eyeling 1.24.7 → 1.24.9

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (184) hide show
  1. package/HANDBOOK.md +35 -35
  2. package/dist/browser/eyeling.browser.js +14 -1
  3. package/examples/act-alarm-bit-interoperability.n3 +5 -3
  4. package/examples/act-barley-seed-lineage.n3 +5 -3
  5. package/examples/act-docking-abort.n3 +5 -3
  6. package/examples/act-gravity-mediator-witness.n3 +5 -3
  7. package/examples/act-isolation-breach.n3 +5 -3
  8. package/examples/act-photosynthetic-exciton-transfer.n3 +5 -3
  9. package/examples/act-sensor-memory-reset.n3 +5 -3
  10. package/examples/act-tunnel-junction-wake-switch.n3 +5 -3
  11. package/examples/act-yeast-self-reproduction.n3 +5 -3
  12. package/examples/annotation.n3 +5 -0
  13. package/examples/auroracare.n3 +29 -29
  14. package/examples/backward-recursion.n3 +5 -0
  15. package/examples/barley-seed-becoming.n3 +5 -3
  16. package/examples/bmi.n3 +5 -3
  17. package/examples/builtin-coverage.n3 +5 -0
  18. package/examples/calidor.n3 +3 -3
  19. package/examples/collection.n3 +5 -0
  20. package/examples/complex-matrix-stability.n3 +5 -3
  21. package/examples/context-association.n3 +1 -9
  22. package/examples/control-system.n3 +5 -3
  23. package/examples/deep-taxonomy-10.n3 +5 -3
  24. package/examples/deep-taxonomy-100.n3 +5 -3
  25. package/examples/deep-taxonomy-1000.n3 +5 -3
  26. package/examples/deep-taxonomy-10000.n3 +5 -3
  27. package/examples/deep-taxonomy-100000.n3 +3 -1
  28. package/examples/delfour.n3 +3 -3
  29. package/examples/digital-product-passport.n3 +2 -0
  30. package/examples/dijkstra-risk-path.n3 +1 -2
  31. package/examples/easter.n3 +6 -4
  32. package/examples/eco-route-insight.n3 +1 -2
  33. package/examples/flandor.n3 +3 -3
  34. package/examples/french-cities.n3 +5 -3
  35. package/examples/fundamental-theorem-arithmetic.n3 +5 -3
  36. package/examples/genetic-algorithm-knapsack.n3 +1 -1
  37. package/examples/genetic-algorithm.n3 +1 -1
  38. package/examples/genetic-knapsack-selection.n3 +1 -2
  39. package/examples/gps.n3 +5 -3
  40. package/examples/harborsmr.n3 +5 -3
  41. package/examples/input/ontology-question-generation.trig +79 -0
  42. package/examples/input/rdf-message-flow.trig +10 -10
  43. package/examples/input/rdf-messages.trig +6 -6
  44. package/examples/interop-demo.n3 +3 -1
  45. package/examples/matrix-mechanics.n3 +3 -3
  46. package/examples/medior.n3 +3 -3
  47. package/examples/n3-speaks-for-itself.n3 +5 -0
  48. package/examples/odrl-dpv-ehds-risk-ranked.n3 +1 -1
  49. package/examples/odrl-dpv-healthcare-risk-ranked.n3 +1 -1
  50. package/examples/odrl-dpv-risk-ranked.n3 +1 -1
  51. package/examples/odrl-risk-mitigation.n3 +1 -1
  52. package/examples/odrl-risk.n3 +1 -1
  53. package/examples/ontology-question-generation.n3 +409 -0
  54. package/examples/output/{act-alarm-bit-interoperability.txt → act-alarm-bit-interoperability.md} +23 -17
  55. package/examples/output/act-barley-seed-lineage.md +31 -0
  56. package/examples/output/{act-docking-abort.txt → act-docking-abort.md} +25 -19
  57. package/examples/output/{act-gravity-mediator-witness.txt → act-gravity-mediator-witness.md} +27 -21
  58. package/examples/output/{act-isolation-breach.txt → act-isolation-breach.md} +30 -24
  59. package/examples/output/{act-photosynthetic-exciton-transfer.txt → act-photosynthetic-exciton-transfer.md} +23 -17
  60. package/examples/output/{act-sensor-memory-reset.txt → act-sensor-memory-reset.md} +23 -17
  61. package/examples/output/{act-tunnel-junction-wake-switch.txt → act-tunnel-junction-wake-switch.md} +24 -18
  62. package/examples/output/{act-yeast-self-reproduction.txt → act-yeast-self-reproduction.md} +26 -20
  63. package/examples/output/annotation.md +7 -0
  64. package/examples/output/auroracare.md +154 -0
  65. package/examples/output/backward-recursion.md +11 -0
  66. package/examples/output/barley-seed-becoming.md +31 -0
  67. package/examples/output/bmi.md +26 -0
  68. package/examples/output/builtin-coverage.md +7 -0
  69. package/examples/output/calidor.md +35 -0
  70. package/examples/output/collection.md +7 -0
  71. package/examples/output/{complex-matrix-stability.txt → complex-matrix-stability.md} +17 -11
  72. package/examples/output/context-association.md +12 -0
  73. package/examples/output/{control-system.txt → control-system.md} +23 -17
  74. package/examples/output/deep-taxonomy-10.md +21 -0
  75. package/examples/output/deep-taxonomy-100.md +21 -0
  76. package/examples/output/{deep-taxonomy-1000.txt → deep-taxonomy-1000.md} +18 -12
  77. package/examples/output/{deep-taxonomy-10000.txt → deep-taxonomy-10000.md} +18 -12
  78. package/examples/output/{deep-taxonomy-100000.txt → deep-taxonomy-100000.md} +18 -12
  79. package/examples/output/delfour.md +36 -0
  80. package/examples/output/digital-product-passport.md +7 -0
  81. package/examples/output/dijkstra-risk-path.md +16 -0
  82. package/examples/output/{easter.txt → easter.md} +156 -150
  83. package/examples/output/eco-route-insight.md +25 -0
  84. package/examples/output/flandor.md +37 -0
  85. package/examples/output/{french-cities.txt → french-cities.md} +17 -11
  86. package/examples/output/{fundamental-theorem-arithmetic.txt → fundamental-theorem-arithmetic.md} +18 -12
  87. package/examples/output/genetic-algorithm-knapsack.md +7 -0
  88. package/examples/output/genetic-algorithm.md +7 -0
  89. package/examples/output/genetic-knapsack-selection.md +18 -0
  90. package/examples/output/{gps.txt → gps.md} +18 -12
  91. package/examples/output/harborsmr.md +26 -0
  92. package/examples/output/interop-demo.md +7 -0
  93. package/examples/output/matrix-mechanics.md +20 -0
  94. package/examples/output/medior.md +38 -0
  95. package/examples/output/n3-speaks-for-itself.md +58 -0
  96. package/examples/output/{odrl-dpv-ehds-risk-ranked.txt → odrl-dpv-ehds-risk-ranked.md} +20 -15
  97. package/examples/output/{odrl-dpv-healthcare-risk-ranked.txt → odrl-dpv-healthcare-risk-ranked.md} +17 -12
  98. package/examples/output/{odrl-dpv-risk-ranked.txt → odrl-dpv-risk-ranked.md} +21 -16
  99. package/examples/output/{odrl-risk-mitigation.txt → odrl-risk-mitigation.md} +21 -16
  100. package/examples/output/{odrl-risk.txt → odrl-risk.md} +10 -5
  101. package/examples/output/ontology-question-generation.md +31 -0
  102. package/examples/output/parcellocker.md +26 -0
  103. package/examples/output/pn-junction-tunneling.md +29 -0
  104. package/examples/output/queens.md +27 -0
  105. package/examples/output/rc-discharge-envelope.md +16 -0
  106. package/examples/output/rdf-dataset.md +12 -0
  107. package/examples/output/rdf-message-flow.md +12 -0
  108. package/examples/output/rdf-messages.md +12 -0
  109. package/examples/output/{resto.txt → resto.md} +23 -17
  110. package/examples/output/school-placement-audit.md +16 -0
  111. package/examples/output/smoke-arithmetic.md +12 -0
  112. package/examples/output/sqrt2-cauchy.md +19 -0
  113. package/examples/output/sqrt2-dedekind.md +37 -0
  114. package/examples/output/sudoku.md +49 -0
  115. package/examples/output/transcendental-numbers-stretched.md +266 -0
  116. package/examples/output/transistor-switch.md +30 -0
  117. package/examples/output/triple-terms.md +12 -0
  118. package/examples/output/{tunnel-junction-wake-switch-becoming.txt → tunnel-junction-wake-switch-becoming.md} +24 -18
  119. package/examples/output/{wind-turbine.txt → wind-turbine.md} +21 -15
  120. package/examples/parcellocker.n3 +3 -1
  121. package/examples/pn-junction-tunneling.n3 +3 -3
  122. package/examples/queens.n3 +1 -0
  123. package/examples/rc-discharge-envelope.n3 +1 -1
  124. package/examples/rdf-dataset.n3 +5 -0
  125. package/examples/rdf-message-flow.n3 +1 -2
  126. package/examples/rdf-messages.n3 +1 -2
  127. package/examples/resto.n3 +5 -3
  128. package/examples/school-placement-audit.n3 +1 -2
  129. package/examples/smoke-arithmetic.n3 +1 -1
  130. package/examples/sqrt2-cauchy.n3 +2 -0
  131. package/examples/sqrt2-dedekind.n3 +2 -0
  132. package/examples/sudoku.n3 +14 -14
  133. package/examples/transcendental-numbers-stretched.n3 +5 -0
  134. package/examples/transistor-switch.n3 +3 -3
  135. package/examples/triple-terms.n3 +5 -0
  136. package/examples/tunnel-junction-wake-switch-becoming.n3 +5 -3
  137. package/examples/wind-turbine.n3 +5 -3
  138. package/eyeling.js +14 -1
  139. package/lib/explain.js +14 -1
  140. package/package.json +1 -1
  141. package/test/examples.test.js +44 -13
  142. package/test/package.test.js +43 -7
  143. package/examples/output/act-barley-seed-lineage.txt +0 -25
  144. package/examples/output/annotation.n3 +0 -0
  145. package/examples/output/auroracare.txt +0 -149
  146. package/examples/output/backward-recursion.n3 +0 -4
  147. package/examples/output/barley-seed-becoming.txt +0 -25
  148. package/examples/output/bmi.txt +0 -20
  149. package/examples/output/builtin-coverage.n3 +0 -0
  150. package/examples/output/calidor.txt +0 -29
  151. package/examples/output/collection.n3 +0 -0
  152. package/examples/output/context-association.n3 +0 -9
  153. package/examples/output/deep-taxonomy-10.txt +0 -15
  154. package/examples/output/deep-taxonomy-100.txt +0 -15
  155. package/examples/output/delfour.txt +0 -30
  156. package/examples/output/digital-product-passport.txt +0 -1
  157. package/examples/output/dijkstra-risk-path.n3 +0 -3
  158. package/examples/output/eco-route-insight.n3 +0 -3
  159. package/examples/output/flandor.txt +0 -31
  160. package/examples/output/genetic-algorithm-knapsack.txt +0 -1
  161. package/examples/output/genetic-algorithm.txt +0 -1
  162. package/examples/output/genetic-knapsack-selection.n3 +0 -3
  163. package/examples/output/harborsmr.txt +0 -20
  164. package/examples/output/interop-demo.txt +0 -1
  165. package/examples/output/matrix-mechanics.txt +0 -14
  166. package/examples/output/medior.txt +0 -32
  167. package/examples/output/n3-speaks-for-itself.txt +0 -52
  168. package/examples/output/parcellocker.txt +0 -20
  169. package/examples/output/pn-junction-tunneling.txt +0 -23
  170. package/examples/output/queens.txt +0 -21
  171. package/examples/output/rc-discharge-envelope.n3 +0 -9
  172. package/examples/output/rc-discharge-envelope.txt +0 -9
  173. package/examples/output/rdf-dataset.n3 +0 -5
  174. package/examples/output/rdf-message-flow.n3 +0 -7
  175. package/examples/output/rdf-messages.n3 +0 -7
  176. package/examples/output/school-placement-audit.n3 +0 -3
  177. package/examples/output/smoke-arithmetic.n3 +0 -5
  178. package/examples/output/smoke-arithmetic.txt +0 -5
  179. package/examples/output/sqrt2-cauchy.txt +0 -13
  180. package/examples/output/sqrt2-dedekind.txt +0 -31
  181. package/examples/output/sudoku.txt +0 -43
  182. package/examples/output/transcendental-numbers-stretched.txt +0 -260
  183. package/examples/output/transistor-switch.txt +0 -24
  184. package/examples/output/triple-terms.n3 +0 -5
@@ -0,0 +1,266 @@
1
+ # transcendental-numbers-stretched
2
+
3
+ ## Source files
4
+
5
+ - [N3 rules](../transcendental-numbers-stretched.n3)
6
+
7
+ @prefix : <https://example.org/transcendental#> .
8
+
9
+ :report :concerns :prod_e_pi .
10
+ :report :concerns :sum_e_pi .
11
+ :report :headline :quadraticTrick .
12
+ :report :irrational :e .
13
+ :report :irrational :e_div_2 .
14
+ :report :irrational :e_plus_1 .
15
+ :report :irrational :e_plus_2 .
16
+ :report :irrational :exp_minus_pi_over_2 .
17
+ :report :irrational :exp_sqrt2 .
18
+ :report :irrational :half_times_e .
19
+ :report :irrational :half_times_pi .
20
+ :report :irrational :pi .
21
+ :report :irrational :pi_div_2 .
22
+ :report :irrational :pi_plus_1 .
23
+ :report :irrational :pi_plus_sqrt2 .
24
+ :report :irrational :pow_2_sqrt2 .
25
+ :report :irrational :pow_e_pi .
26
+ :report :irrational :pow_i_i .
27
+ :report :irrational :pow_minus1_minusI .
28
+ :report :irrational :pow2sqrt2_div_2 .
29
+ :report :irrational :pow2sqrt2_plus_1 .
30
+ :report :irrational :two_times_e .
31
+ :report :irrational :two_times_pi .
32
+ :report :irrational :two_times_pow2sqrt2 .
33
+ :report :notConstructible :e .
34
+ :report :notConstructible :e_div_2 .
35
+ :report :notConstructible :e_plus_1 .
36
+ :report :notConstructible :e_plus_2 .
37
+ :report :notConstructible :exp_minus_pi_over_2 .
38
+ :report :notConstructible :exp_sqrt2 .
39
+ :report :notConstructible :half_times_e .
40
+ :report :notConstructible :half_times_pi .
41
+ :report :notConstructible :pi .
42
+ :report :notConstructible :pi_div_2 .
43
+ :report :notConstructible :pi_plus_1 .
44
+ :report :notConstructible :pi_plus_sqrt2 .
45
+ :report :notConstructible :pow_2_sqrt2 .
46
+ :report :notConstructible :pow_e_pi .
47
+ :report :notConstructible :pow_i_i .
48
+ :report :notConstructible :pow_minus1_minusI .
49
+ :report :notConstructible :pow2sqrt2_div_2 .
50
+ :report :notConstructible :pow2sqrt2_plus_1 .
51
+ :report :notConstructible :two_times_e .
52
+ :report :notConstructible :two_times_pi .
53
+ :report :notConstructible :two_times_pow2sqrt2 .
54
+ :report :proof {
55
+ :e :provedBy :Hermite1873 .
56
+ } .
57
+ :report :proof {
58
+ :e :provedBy :TransImpliesIrrational .
59
+ } .
60
+ :report :proof {
61
+ :e :provedBy :TransImpliesNotConstructible .
62
+ } .
63
+ :report :proof {
64
+ :e_div_2 :provedBy :TransDivAlg .
65
+ } .
66
+ :report :proof {
67
+ :e_div_2 :provedBy :TransImpliesIrrational .
68
+ } .
69
+ :report :proof {
70
+ :e_div_2 :provedBy :TransImpliesNotConstructible .
71
+ } .
72
+ :report :proof {
73
+ :e_plus_1 :provedBy :TransImpliesIrrational .
74
+ } .
75
+ :report :proof {
76
+ :e_plus_1 :provedBy :TransImpliesNotConstructible .
77
+ } .
78
+ :report :proof {
79
+ :e_plus_1 :provedBy :TransPlusAlg .
80
+ } .
81
+ :report :proof {
82
+ :e_plus_2 :provedBy :TransImpliesIrrational .
83
+ } .
84
+ :report :proof {
85
+ :e_plus_2 :provedBy :TransImpliesNotConstructible .
86
+ } .
87
+ :report :proof {
88
+ :e_plus_2 :provedBy :TransPlusAlg .
89
+ } .
90
+ :report :proof {
91
+ :exp_minus_pi_over_2 :provedBy :GelfondSchneider .
92
+ } .
93
+ :report :proof {
94
+ :exp_minus_pi_over_2 :provedBy :TransImpliesIrrational .
95
+ } .
96
+ :report :proof {
97
+ :exp_minus_pi_over_2 :provedBy :TransImpliesNotConstructible .
98
+ } .
99
+ :report :proof {
100
+ :exp_sqrt2 :provedBy :LindemannWeierstrass .
101
+ } .
102
+ :report :proof {
103
+ :exp_sqrt2 :provedBy :TransImpliesIrrational .
104
+ } .
105
+ :report :proof {
106
+ :exp_sqrt2 :provedBy :TransImpliesNotConstructible .
107
+ } .
108
+ :report :proof {
109
+ :half_times_e :provedBy :TransImpliesIrrational .
110
+ } .
111
+ :report :proof {
112
+ :half_times_e :provedBy :TransImpliesNotConstructible .
113
+ } .
114
+ :report :proof {
115
+ :half_times_e :provedBy :TransTimesAlg .
116
+ } .
117
+ :report :proof {
118
+ :half_times_pi :provedBy :TransImpliesIrrational .
119
+ } .
120
+ :report :proof {
121
+ :half_times_pi :provedBy :TransImpliesNotConstructible .
122
+ } .
123
+ :report :proof {
124
+ :half_times_pi :provedBy :TransTimesAlg .
125
+ } .
126
+ :report :proof {
127
+ :pi :provedBy :Lindemann1882 .
128
+ } .
129
+ :report :proof {
130
+ :pi :provedBy :TransImpliesIrrational .
131
+ } .
132
+ :report :proof {
133
+ :pi :provedBy :TransImpliesNotConstructible .
134
+ } .
135
+ :report :proof {
136
+ :pi_div_2 :provedBy :TransDivAlg .
137
+ } .
138
+ :report :proof {
139
+ :pi_div_2 :provedBy :TransImpliesIrrational .
140
+ } .
141
+ :report :proof {
142
+ :pi_div_2 :provedBy :TransImpliesNotConstructible .
143
+ } .
144
+ :report :proof {
145
+ :pi_plus_1 :provedBy :TransImpliesIrrational .
146
+ } .
147
+ :report :proof {
148
+ :pi_plus_1 :provedBy :TransImpliesNotConstructible .
149
+ } .
150
+ :report :proof {
151
+ :pi_plus_1 :provedBy :TransPlusAlg .
152
+ } .
153
+ :report :proof {
154
+ :pi_plus_sqrt2 :provedBy :TransImpliesIrrational .
155
+ } .
156
+ :report :proof {
157
+ :pi_plus_sqrt2 :provedBy :TransImpliesNotConstructible .
158
+ } .
159
+ :report :proof {
160
+ :pi_plus_sqrt2 :provedBy :TransPlusAlg .
161
+ } .
162
+ :report :proof {
163
+ :pow_2_sqrt2 :provedBy :GelfondSchneider .
164
+ } .
165
+ :report :proof {
166
+ :pow_2_sqrt2 :provedBy :TransImpliesIrrational .
167
+ } .
168
+ :report :proof {
169
+ :pow_2_sqrt2 :provedBy :TransImpliesNotConstructible .
170
+ } .
171
+ :report :proof {
172
+ :pow_e_pi :provedBy :GelfondSchneider .
173
+ } .
174
+ :report :proof {
175
+ :pow_e_pi :provedBy :TransImpliesIrrational .
176
+ } .
177
+ :report :proof {
178
+ :pow_e_pi :provedBy :TransImpliesNotConstructible .
179
+ } .
180
+ :report :proof {
181
+ :pow_i_i :provedBy :GelfondSchneider .
182
+ } .
183
+ :report :proof {
184
+ :pow_i_i :provedBy :TransImpliesIrrational .
185
+ } .
186
+ :report :proof {
187
+ :pow_i_i :provedBy :TransImpliesNotConstructible .
188
+ } .
189
+ :report :proof {
190
+ :pow_minus1_minusI :provedBy :GelfondSchneider .
191
+ } .
192
+ :report :proof {
193
+ :pow_minus1_minusI :provedBy :TransImpliesIrrational .
194
+ } .
195
+ :report :proof {
196
+ :pow_minus1_minusI :provedBy :TransImpliesNotConstructible .
197
+ } .
198
+ :report :proof {
199
+ :pow2sqrt2_div_2 :provedBy :TransDivAlg .
200
+ } .
201
+ :report :proof {
202
+ :pow2sqrt2_div_2 :provedBy :TransImpliesIrrational .
203
+ } .
204
+ :report :proof {
205
+ :pow2sqrt2_div_2 :provedBy :TransImpliesNotConstructible .
206
+ } .
207
+ :report :proof {
208
+ :pow2sqrt2_plus_1 :provedBy :TransImpliesIrrational .
209
+ } .
210
+ :report :proof {
211
+ :pow2sqrt2_plus_1 :provedBy :TransImpliesNotConstructible .
212
+ } .
213
+ :report :proof {
214
+ :pow2sqrt2_plus_1 :provedBy :TransPlusAlg .
215
+ } .
216
+ :report :proof {
217
+ :two_times_e :provedBy :TransImpliesIrrational .
218
+ } .
219
+ :report :proof {
220
+ :two_times_e :provedBy :TransImpliesNotConstructible .
221
+ } .
222
+ :report :proof {
223
+ :two_times_e :provedBy :TransTimesAlg .
224
+ } .
225
+ :report :proof {
226
+ :two_times_pi :provedBy :TransImpliesIrrational .
227
+ } .
228
+ :report :proof {
229
+ :two_times_pi :provedBy :TransImpliesNotConstructible .
230
+ } .
231
+ :report :proof {
232
+ :two_times_pi :provedBy :TransTimesAlg .
233
+ } .
234
+ :report :proof {
235
+ :two_times_pow2sqrt2 :provedBy :TransImpliesIrrational .
236
+ } .
237
+ :report :proof {
238
+ :two_times_pow2sqrt2 :provedBy :TransImpliesNotConstructible .
239
+ } .
240
+ :report :proof {
241
+ :two_times_pow2sqrt2 :provedBy :TransTimesAlg .
242
+ } .
243
+ :report :transcendental :e .
244
+ :report :transcendental :e_div_2 .
245
+ :report :transcendental :e_plus_1 .
246
+ :report :transcendental :e_plus_2 .
247
+ :report :transcendental :exp_minus_pi_over_2 .
248
+ :report :transcendental :exp_sqrt2 .
249
+ :report :transcendental :half_times_e .
250
+ :report :transcendental :half_times_pi .
251
+ :report :transcendental :pi .
252
+ :report :transcendental :pi_div_2 .
253
+ :report :transcendental :pi_plus_1 .
254
+ :report :transcendental :pi_plus_sqrt2 .
255
+ :report :transcendental :pow_2_sqrt2 .
256
+ :report :transcendental :pow_e_pi .
257
+ :report :transcendental :pow_i_i .
258
+ :report :transcendental :pow_minus1_minusI .
259
+ :report :transcendental :pow2sqrt2_div_2 .
260
+ :report :transcendental :pow2sqrt2_plus_1 .
261
+ :report :transcendental :two_times_e .
262
+ :report :transcendental :two_times_pi .
263
+ :report :transcendental :two_times_pow2sqrt2 .
264
+ :report :unknown :pow_pi_e .
265
+ :report :unknown :prod_e_pi .
266
+ :report :unknown :sum_e_pi .
@@ -0,0 +1,30 @@
1
+ # transistor-switch
2
+
3
+ ## Source files
4
+
5
+ - [N3 rules](../transistor-switch.n3)
6
+
7
+ ## Answer
8
+ In this toy transistor-switch model, a low input leaves the transistor in cutoff (OFF) and a high input drives it into saturation (ON), so the load behaves like an on/off branch rather than a linear amplifier.
9
+ case : transistor-switch
10
+ low input state : cutoff / OFF
11
+ high input state : saturation / ON
12
+ on-state load current : 4.80 mA
13
+
14
+ ## Reason Why
15
+ We model an NPN low-side switch with exact millivolt and microamp arithmetic. The base current comes from (Vin - Vbe,on)/Rb when the base-emitter junction is forward biased, and the collector current is the smaller of beta * Ib and the load-limited current (Vcc - Vce,sat)/Rl.
16
+ supply voltage : 5.00 V
17
+ base resistor : 10000 ohms
18
+ load resistor : 1000 ohms
19
+ transistor beta proxy : 100
20
+ low input : Vin=0.00 V -> Ib=0.00 mA, Ic=0.00 mA, Vce=5.00 V, state=cutoff / OFF
21
+ high input : Vin=5.00 V -> Ib=0.43 mA, Ic=4.80 mA, Vce=0.20 V, state=saturation / ON
22
+ high-input gain limit : 43.00 mA
23
+ high-input load limit : 4.80 mA
24
+
25
+ ## Check
26
+ low input stays in cutoff : yes
27
+ high input reaches saturation : yes
28
+ switching states differ : yes
29
+ on-state current is load-limited : yes
30
+ load voltage matches resistor drop : yes
@@ -0,0 +1,12 @@
1
+ # triple-terms
2
+
3
+ ## Source files
4
+
5
+ - [N3 rules](../triple-terms.n3)
6
+ - [Input TriG](../input/triple-terms.trig)
7
+
8
+ VERSION "1.2"
9
+
10
+ @prefix : <https://eyereasoner.github.io/eyeling/examples/triple_terms#> .
11
+
12
+ :observation :entails <<( :sensor :needs :inspection )>> .
@@ -1,21 +1,27 @@
1
- tunnel-junction wake switchbecoming
1
+ # tunnel-junction-wake-switch-becoming
2
2
 
3
- Answer
4
- YES for the tunnel junction.
5
- NO for the conventional low-bias PN junction in the same wake-switch regime.
3
+ ## Source files
6
4
 
7
- Reason Why
8
- The tunnel junction can be read as a becoming under low forward bias. Because it is modeled as a heavily doped narrow PN junction with overlapping states, it can become a quantum-transfer state. In that regime it can become a sub-threshold current state, and under peak-to-valley scanning it can also become a negative differential response state. As a wake-switch device, that lets it become an ultra-low-bias switching state and finally a leak-alarm wake-serving state. By contrast, the conventional junction lacks the structural conditions needed for the same transition into quantum transfer, so the later wake-serving becoming is blocked as well.
5
+ - [N3 rules](../tunnel-junction-wake-switch-becoming.n3)
9
6
 
10
- Check
11
- B1 OK - the tunnel junction can become a quantum-transfer state
12
- B2 OK - the tunnel junction is classified as tunneling-dominant
13
- B3 OK - the tunnel junction can become a sub-threshold current state
14
- B4 OK - the tunnel junction can become a negative differential response state
15
- B5 OK - the tunnel junction can become an ultra-low-bias switching state
16
- B6 OK - the tunnel junction can become a leak-alarm wake-serving state
17
- B7 OK - the conventional junction cannot become a quantum-transfer state
18
- B8 OK - the conventional junction cannot become a sub-threshold current state
19
- B9 OK - the conventional junction cannot become the tunnel-style negative differential state
20
- B10 OK - the conventional junction cannot become an ultra-low-bias switching state here
21
- B11 OK - the conventional junction cannot become a leak-alarm wake-serving state in this case
7
+ tunnel-junction wake switch — becoming
8
+
9
+ ## Answer
10
+ YES for the tunnel junction.
11
+ NO for the conventional low-bias PN junction in the same wake-switch regime.
12
+
13
+ ## Reason Why
14
+ The tunnel junction can be read as a becoming under low forward bias. Because it is modeled as a heavily doped narrow PN junction with overlapping states, it can become a quantum-transfer state. In that regime it can become a sub-threshold current state, and under peak-to-valley scanning it can also become a negative differential response state. As a wake-switch device, that lets it become an ultra-low-bias switching state and finally a leak-alarm wake-serving state. By contrast, the conventional junction lacks the structural conditions needed for the same transition into quantum transfer, so the later wake-serving becoming is blocked as well.
15
+
16
+ ## Check
17
+ B1 OK - the tunnel junction can become a quantum-transfer state
18
+ B2 OK - the tunnel junction is classified as tunneling-dominant
19
+ B3 OK - the tunnel junction can become a sub-threshold current state
20
+ B4 OK - the tunnel junction can become a negative differential response state
21
+ B5 OK - the tunnel junction can become an ultra-low-bias switching state
22
+ B6 OK - the tunnel junction can become a leak-alarm wake-serving state
23
+ B7 OK - the conventional junction cannot become a quantum-transfer state
24
+ B8 OK - the conventional junction cannot become a sub-threshold current state
25
+ B9 OK - the conventional junction cannot become the tunnel-style negative differential state
26
+ B10 OK - the conventional junction cannot become an ultra-low-bias switching state here
27
+ B11 OK - the conventional junction cannot become a leak-alarm wake-serving state in this case
@@ -1,18 +1,24 @@
1
- Wind turbine — Predictive maintenance
1
+ # wind-turbine
2
2
 
3
- Answer
4
- Act now: schedule an urgent inspection and gearbox maintenance.
3
+ ## Source files
5
4
 
6
- Reason Why
7
- North field turbine reports vibration 0.42 against a threshold of 0.35, temperature 78 against a threshold of 75, and rotor speed 1650 against a critical limit of 1800. Both vibration and temperature are above their safety thresholds, so the turbine shows a combined warning pattern. The gearbox is also degraded, so maintenance is needed even though the rotor speed is still below the critical RPM limit.
5
+ - [N3 rules](../wind-turbine.n3)
8
6
 
9
- Check
10
- C1 OK - measured vibration is above the vibration threshold.
11
- C2 OK - measured temperature is above the temperature threshold.
12
- C3 OK - a high-vibration anomaly was inferred from the readings.
13
- C4 OK - a high-temperature anomaly was inferred from the readings.
14
- C5 OK - urgent inspection follows from the combination of both anomalies.
15
- C6 OK - the gearbox is marked as degraded.
16
- C7 OK - degraded gearbox status triggered gearbox maintenance.
17
- C8 OK - rotor speed is below the critical RPM threshold, so the urgent action is not based on overspeed.
18
- C9 OK - two separate actions were derived: inspection and maintenance.
7
+ Wind turbine — Predictive maintenance
8
+
9
+ ## Answer
10
+ Act now: schedule an urgent inspection and gearbox maintenance.
11
+
12
+ ## Reason Why
13
+ North field turbine reports vibration 0.42 against a threshold of 0.35, temperature 78 against a threshold of 75, and rotor speed 1650 against a critical limit of 1800. Both vibration and temperature are above their safety thresholds, so the turbine shows a combined warning pattern. The gearbox is also degraded, so maintenance is needed even though the rotor speed is still below the critical RPM limit.
14
+
15
+ ## Check
16
+ C1 OK - measured vibration is above the vibration threshold.
17
+ C2 OK - measured temperature is above the temperature threshold.
18
+ C3 OK - a high-vibration anomaly was inferred from the readings.
19
+ C4 OK - a high-temperature anomaly was inferred from the readings.
20
+ C5 OK - urgent inspection follows from the combination of both anomalies.
21
+ C6 OK - the gearbox is marked as degraded.
22
+ C7 OK - degraded gearbox status triggered gearbox maintenance.
23
+ C8 OK - rotor speed is below the critical RPM threshold, so the urgent action is not based on overspeed.
24
+ C9 OK - two separate actions were derived: inspection and maintenance.
@@ -11,6 +11,8 @@
11
11
  @prefix : <https://example.org/parcellocker#> .
12
12
  @prefix log: <http://www.w3.org/2000/10/swap/log#> .
13
13
 
14
+ :000_md_title log:outputString "# parcellocker\n\n## Source files\n\n- [N3 rules](../parcellocker.n3)\n\n" .
15
+
14
16
  # -----
15
17
  # Facts
16
18
  # -----
@@ -101,7 +103,7 @@
101
103
 
102
104
  { :case :decision :Permit . }
103
105
  => {
104
- :out log:outputString "ParcelLocker — One-time parcel pickup by a friend\n\nAnswer\nPERMIT\nNoah may collect Maya's parcel from locker B17.\n\nReason Why\nMaya created a one-time authorization for Noah only, for this parcel only, at this locker only, and for pickup only. The token is active, the parcel is ready, and the same authorization does not reveal billing details or allow redirection.\n\nCheck\nC1 OK - requester matches the named delegate\nC2 OK - requested parcel matches the authorized parcel\nC3 OK - requested locker matches the authorized locker\nC4 OK - requested action is parcel collection\nC5 OK - requested purpose is pickup only\nC6 OK - authorization is active\nC7 OK - authorization is single-use\nC8 OK - parcel is ready for pickup\nC9 OK - billing details stay hidden\nC10 OK - parcel redirection is not allowed\n" .
106
+ :out log:outputString "ParcelLocker — One-time parcel pickup by a friend\n\n## Answer\nPERMIT\nNoah may collect Maya's parcel from locker B17.\n\n## Reason Why\nMaya created a one-time authorization for Noah only, for this parcel only, at this locker only, and for pickup only. The token is active, the parcel is ready, and the same authorization does not reveal billing details or allow redirection.\n\n## Check\nC1 OK - requester matches the named delegate\nC2 OK - requested parcel matches the authorized parcel\nC3 OK - requested locker matches the authorized locker\nC4 OK - requested action is parcel collection\nC5 OK - requested purpose is pickup only\nC6 OK - authorization is active\nC7 OK - authorization is single-use\nC8 OK - parcel is ready for pickup\nC9 OK - billing details stay hidden\nC10 OK - parcel redirection is not allowed\n" .
105
107
  } .
106
108
 
107
109
  # ----------------
@@ -136,7 +136,7 @@
136
136
  ( "peak current proxy : %s\n" ?peakCurrent ) string:format ?peakCurrentLine .
137
137
  }
138
138
  => {
139
- :01-answer-1 log:outputString "=== Answer ===\n" .
139
+ :01-answer-1 log:outputString "# pn-junction-tunneling\n\n## Source files\n\n- [N3 rules](../pn-junction-tunneling.n3)\n\n## Answer\n" .
140
140
  :01-answer-2 log:outputString "In this toy PN-junction tunneling model, heavy doping narrows the depletion region enough for a tunneling window that rises to a peak and then falls, producing a negative-differential region.\n" .
141
141
  :01-answer-3 log:outputString "case : pn-junction-tunneling\n" .
142
142
  :01-answer-4 log:outputString ?peakBiasLine .
@@ -167,7 +167,7 @@
167
167
  ( "high-bias point : %s -> %s\n" ?valleyBias ?valleyCurrent ) string:format ?valleyLine .
168
168
  }
169
169
  => {
170
- :02-why-1 log:outputString "=== Reason Why ===\n" .
170
+ :02-why-1 log:outputString "## Reason Why\n" .
171
171
  :02-why-2 log:outputString "We model tunneling current as an exact overlap count between filled N-side states and empty P-side states while forward bias shifts the bands. Heavy doping is represented by a much narrower depletion region.\n" .
172
172
  :02-why-3 log:outputString ?ordinaryLine .
173
173
  :02-why-4 log:outputString ?tunnelLine .
@@ -187,7 +187,7 @@
187
187
  :case :peakMatchesFullOverlap true .
188
188
  }
189
189
  => {
190
- :03-check-1 log:outputString "=== Check ===\n" .
190
+ :03-check-1 log:outputString "## Check\n" .
191
191
  :03-check-2 log:outputString "heavily doped barrier is narrower : yes\n" .
192
192
  :03-check-3 log:outputString "peak occurs before overlap closes : yes\n" .
193
193
  :03-check-4 log:outputString "negative differential region present : yes\n" .
@@ -16,5 +16,6 @@
16
16
  :run :n ?N; :maxPrint ?MaxPrint.
17
17
  (?N ?MaxPrint) :render ?Report.
18
18
  } log:query {
19
+ :000_md_title log:outputString "# queens\n\n## Source files\n\n- [N3 rules](../queens.n3)\n\n" .
19
20
  :answer log:outputString ?Report.
20
21
  }.
@@ -44,5 +44,5 @@
44
44
  {
45
45
  :case :exactDecaySymbol ?Symbol; :decayLower ?Lower; :decayUpper ?Upper; :firstBelowToleranceStep ?Step.
46
46
  ?Step :index ?Index; :timeSeconds ?Time; :upperVoltage ?Voltage.
47
- ("=== Answer ===\nexact decay symbol : %s\ncertified decay interval : [%.10f, %.10f]\nfirst below tolerance step : %d\nfirst below tolerance time : %.3f s\nupper voltage at step %d : %.6f V\n\n=== Explanation ===\nThe physical decay factor is exp(-1/4), but the example uses a finite double interval as the certificate. Because the interval lies strictly between 0 and 1, the capacitor voltage envelope contracts each sample. The upper envelope is the safety-relevant bound: once it falls below 1.0 V, every compatible exact trajectory is below tolerance." ?Symbol ?Lower ?Upper ?Index ?Time ?Index ?Voltage) string:format ?Block.
47
+ ("# rc-discharge-envelope\n\n## Source files\n\n- [N3 rules](../rc-discharge-envelope.n3)\n- [Input TriG](../input/rc-discharge-envelope.trig)\n\n## Answer\nexact decay symbol : %s\ncertified decay interval : [%.10f, %.10f]\nfirst below tolerance step : %d\nfirst below tolerance time : %.3f s\nupper voltage at step %d : %.6f V\n\n## Explanation\nThe physical decay factor is exp(-1/4), but the example uses a finite double interval as the certificate. Because the interval lies strictly between 0 and 1, the capacitor voltage envelope contracts each sample. The upper envelope is the safety-relevant bound: once it falls below 1.0 V, every compatible exact trajectory is below tolerance." ?Symbol ?Lower ?Upper ?Index ?Time ?Index ?Voltage) string:format ?Block.
48
48
  } => { :report log:outputString ?Block. }.
@@ -23,3 +23,8 @@ VERSION "1.2"
23
23
  } log:query {
24
24
  :workOrder :entails <<( ?device :needs ?action )>> .
25
25
  } .
26
+
27
+
28
+ # Markdown rendering via log:outputString.
29
+ :__md_output :text "# rdf-dataset\n\n## Source files\n\n- [N3 rules](../rdf-dataset.n3)\n- [Input TriG](../input/rdf-dataset.trig)\n\nVERSION \"1.2\"\n\n@prefix : <https://eyereasoner.github.io/eyeling/examples/rdf-dataset#> .\n\n:workOrder :entails <<( :sensor :needs :inspection )>> .\n" .
30
+ { :__md_output :text ?text } log:query { :__md_output log:outputString ?text } .
@@ -134,10 +134,9 @@
134
134
  :m005 :atStage :sink;
135
135
  msg:payloadResult ?FifthResult;
136
136
  :route :alertSink.
137
- ("=== Answer ===\nContinuous RDF Message flow accepted: %d ordered messages moved through the ingest → validate → interpret → route → sink pipeline. The threshold was %d, so results %s and %s were archived, the heartbeat kept the stream alive, and results %s and %s were emitted as alerts.\n\n=== Explanation ===\nThe N3 source starts only :m001 at ingress. Each message must reach :sink before the continuous-flow rule releases its msg:nextMessage. Observation payloads are inspected with log:includes inside each message formula, while the empty heartbeat uses the same envelope and routing stages without a payload. This models messages flowing through a live stream while preserving message boundaries." ?Count ?Threshold ?FirstResult ?SecondResult ?FourthResult ?FifthResult) string:format ?Block.
137
+ ("# rdf-message-flow\n\n## Source files\n\n- [N3 rules](../rdf-message-flow.n3)\n- [Input TriG](../input/rdf-message-flow.trig)\n\n## Answer\nContinuous RDF Message flow accepted: %d ordered messages moved through the ingest → validate → interpret → route → sink pipeline. The threshold was %d, so results %s and %s were archived, the heartbeat kept the stream alive, and results %s and %s were emitted as alerts.\n\n## Explanation\nThe N3 source starts only :m001 at ingress. Each message must reach :sink before the continuous-flow rule releases its msg:nextMessage. Observation payloads are inspected with log:includes inside each message formula, while the empty heartbeat uses the same envelope and routing stages without a payload. This models messages flowing through a live stream while preserving message boundaries." ?Count ?Threshold ?FirstResult ?SecondResult ?FourthResult ?FifthResult) string:format ?Block.
138
138
  } => {
139
139
  :rdfMessageFlowExample log:outputString ?Block.
140
140
  :rdfMessageFlowExample :demonstrates :ContinuousFlow, :BackPressureRelease, :AtomicMessageContext, :HeartbeatInFlow, :ThresholdRouting.
141
141
  }.
142
142
 
143
- { :rdfMessageFlowExample :demonstrates ?Feature } log:query { :rdfMessageFlowExample :demonstrates ?Feature }.
@@ -97,10 +97,9 @@
97
97
  :BlankNodeScope :reusedLabel ?Label;
98
98
  :isPerMessage true.
99
99
  :MessageContext :differentObservationsStayContextual true.
100
- ("=== Answer ===\nRDF Message log accepted: %d explicit message boundaries are preserved. Message :m002 is an empty heartbeat, and the local blank-node label %s is safely reused in separate messages.\n\n=== Explanation ===\nThe N3 source models an RDF Message Log as an ordered sequence of RDF Messages. Each non-empty message has a formula-valued payload that is inspected with log:includes, so the observation data stays inside the message boundary instead of being treated as one global graph. The two temperature results, %s and %s, are different observations from the same stream but are contextualized by their message boundaries." ?Count ?Label ?FirstResult ?SecondResult) string:format ?Block.
100
+ ("# rdf-messages\n\n## Source files\n\n- [N3 rules](../rdf-messages.n3)\n- [Input TriG](../input/rdf-messages.trig)\n\n## Answer\nRDF Message log accepted: %d explicit message boundaries are preserved. Message :m002 is an empty heartbeat, and the local blank-node label %s is safely reused in separate messages.\n\n## Explanation\nThe N3 source models an RDF Message Log as an ordered sequence of RDF Messages. Each non-empty message has a formula-valued payload that is inspected with log:includes, so the observation data stays inside the message boundary instead of being treated as one global graph. The two temperature results, %s and %s, are different observations from the same stream but are contextualized by their message boundaries." ?Count ?Label ?FirstResult ?SecondResult) string:format ?Block.
101
101
  } => {
102
102
  :rdfMessagesExample log:outputString ?Block.
103
103
  :rdfMessagesExample :demonstrates :ExplicitBoundaries, :AtomicMessageContext, :EmptyHeartbeat, :MessageScopedBlankNodes, :ReplayableMessageLog.
104
104
  }.
105
105
 
106
- { :rdfMessagesExample :demonstrates ?Feature } log:query { :rdfMessagesExample :demonstrates ?Feature }.
package/examples/resto.n3 CHANGED
@@ -22,6 +22,8 @@
22
22
  @prefix string: <http://www.w3.org/2000/10/swap/string#>.
23
23
  @prefix log: <http://www.w3.org/2000/10/swap/log#>.
24
24
 
25
+ :000_md_title log:outputString "# resto\n\n## Source files\n\n- [N3 rules](../resto.n3)\n\n" .
26
+
25
27
  # ----------------
26
28
  # Initial question
27
29
  # ----------------
@@ -288,15 +290,15 @@
288
290
  :Check :c8 ?C8.
289
291
  (
290
292
  "RESTdesc — Restaurant finder\n\n"
291
- "Answer\n"
293
+ "## Answer\n"
292
294
  ?Outcome "\n"
293
295
  "Restaurant: " ?RestaurantName "\n"
294
296
  "Date: " ?Date "\n"
295
297
  "Seating: " ?Seating "\n\n"
296
- "Reason Why\n"
298
+ "## Reason Why\n"
297
299
  "The plan resolved the person's address, turned it into a map point, checked the local weather, selected a suitable restaurant, and then created a reservation. "
298
300
  "Because the weather came back mild and stable (22 C and 1016 mbar), the chosen seating stayed outdoors.\n\n"
299
- "Check\n"
301
+ "## Check\n"
300
302
  "C1 " ?C1 "\n"
301
303
  "C2 " ?C2 "\n"
302
304
  "C3 " ?C3 "\n"
@@ -42,10 +42,9 @@
42
42
 
43
43
  {
44
44
  :Audit :result ?Result; :affectedChildren ?Affected; :largestHiddenDetour ?Detour; :recommendedAssignments ?Assignments.
45
- ("=== Answer ===\naudit result : %s\nchildren affected by straight-line rule : %s\nlargest hidden detour : %s\nrecommended assignments : %s\nexplanation requested : yes\n\n=== Explanation ===\nThe support-tool rule chooses the school with the smallest straight-line distance, using preference rank only as a tie-breaker. The independent audit recomputes each candidate with walking-route distance plus 600 m per preference step. Any provisional assignment that is not the audited best, or that requires more than 2500 m of walking, is flagged. Ada and Björn look close to Centrum on a map, but their walking routes cross barriers and exceed the walking limit; Davi is also better served by the first-preference Haga route. This illustrates why a decision-support label is not enough: route geometry, preferences, and audit records must be inspectable." ?Result ?Affected ?Detour ?Assignments) string:format ?Block.
45
+ ("# school-placement-audit\n\n## Source files\n\n- [N3 rules](../school-placement-audit.n3)\n- [Input TriG](../input/school-placement-audit.trig)\n\n## Answer\naudit result : %s\nchildren affected by straight-line rule : %s\nlargest hidden detour : %s\nrecommended assignments : %s\nexplanation requested : yes\n\n## Explanation\nThe support-tool rule chooses the school with the smallest straight-line distance, using preference rank only as a tie-breaker. The independent audit recomputes each candidate with walking-route distance plus 600 m per preference step. Any provisional assignment that is not the audited best, or that requires more than 2500 m of walking, is flagged. Ada and Björn look close to Centrum on a map, but their walking routes cross barriers and exceed the walking limit; Davi is also better served by the first-preference Haga route. This illustrates why a decision-support label is not enough: route geometry, preferences, and audit records must be inspectable." ?Result ?Affected ?Detour ?Assignments) string:format ?Block.
46
46
  } => {
47
47
  :schoolPlacementAudit log:outputString ?Block.
48
48
  :schoolPlacementAudit :reports :Audit.
49
49
  }.
50
50
 
51
- { :schoolPlacementAudit :reports ?Audit } log:query { :schoolPlacementAudit :reports ?Audit }.
@@ -16,5 +16,5 @@
16
16
  } .
17
17
 
18
18
  { :Case :product ?Product.
19
- ("=== Answer ===\nproduct = %s\n\n=== Explanation ===\nThe compiled rule multiplies :x and :y using math:product." ?Product) string:format ?Block.
19
+ ("# smoke-arithmetic\n\n## Source files\n\n- [N3 rules](../smoke-arithmetic.n3)\n- [Input TriG](../input/smoke-arithmetic.trig)\n\n## Answer\nproduct = %s\n\n## Explanation\nThe compiled rule multiplies :x and :y using math:product." ?Product) string:format ?Block.
20
20
  } => { :out01 log:outputString ?Block. } .
@@ -13,6 +13,8 @@
13
13
  @prefix log: <http://www.w3.org/2000/10/swap/log#>.
14
14
  @prefix string:<http://www.w3.org/2000/10/swap/string#>.
15
15
 
16
+ :000_md_title log:outputString "# sqrt2-cauchy\n\n## Source files\n\n- [N3 rules](../sqrt2-cauchy.n3)\n\n" .
17
+
16
18
  :sqrt2Real a :Real;
17
19
  :representedBy :sqrt2Seq.
18
20
 
@@ -9,6 +9,8 @@
9
9
  @prefix log: <http://www.w3.org/2000/10/swap/log#>.
10
10
  @prefix string: <http://www.w3.org/2000/10/swap/string#>.
11
11
 
12
+ :000_md_title log:outputString "# sqrt2-dedekind\n\n## Source files\n\n- [N3 rules](../sqrt2-dedekind.n3)\n\n" .
13
+
12
14
  # -----------------------------------------------------------------
13
15
  # Data: a finite sample of rationals (decimal tokens are rationals)
14
16
  # -----------------------------------------------------------------