eyeling 1.24.8 → 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.
- package/examples/act-alarm-bit-interoperability.n3 +4 -4
- package/examples/act-barley-seed-lineage.n3 +4 -4
- package/examples/act-docking-abort.n3 +4 -4
- package/examples/act-gravity-mediator-witness.n3 +4 -4
- package/examples/act-isolation-breach.n3 +4 -4
- package/examples/act-photosynthetic-exciton-transfer.n3 +4 -4
- package/examples/act-sensor-memory-reset.n3 +4 -4
- package/examples/act-tunnel-junction-wake-switch.n3 +4 -4
- package/examples/act-yeast-self-reproduction.n3 +4 -4
- package/examples/annotation.n3 +1 -1
- package/examples/auroracare.n3 +22 -22
- package/examples/backward-recursion.n3 +1 -1
- package/examples/barley-seed-becoming.n3 +4 -4
- package/examples/bmi.n3 +4 -4
- package/examples/builtin-coverage.n3 +1 -1
- package/examples/calidor.n3 +1 -1
- package/examples/collection.n3 +1 -1
- package/examples/complex-matrix-stability.n3 +4 -4
- package/examples/context-association.n3 +1 -1
- package/examples/control-system.n3 +4 -4
- package/examples/deep-taxonomy-10.n3 +4 -4
- package/examples/deep-taxonomy-100.n3 +4 -4
- package/examples/deep-taxonomy-1000.n3 +4 -4
- package/examples/deep-taxonomy-10000.n3 +4 -4
- package/examples/deep-taxonomy-100000.n3 +2 -2
- package/examples/delfour.n3 +1 -1
- package/examples/digital-product-passport.n3 +1 -1
- package/examples/dijkstra-risk-path.n3 +1 -1
- package/examples/easter.n3 +4 -4
- package/examples/eco-route-insight.n3 +1 -1
- package/examples/flandor.n3 +1 -1
- package/examples/french-cities.n3 +4 -4
- package/examples/fundamental-theorem-arithmetic.n3 +4 -4
- package/examples/genetic-algorithm-knapsack.n3 +1 -1
- package/examples/genetic-algorithm.n3 +1 -1
- package/examples/genetic-knapsack-selection.n3 +1 -1
- package/examples/gps.n3 +4 -4
- package/examples/harborsmr.n3 +4 -4
- package/examples/input/ontology-question-generation.trig +79 -0
- package/examples/interop-demo.n3 +1 -1
- package/examples/matrix-mechanics.n3 +1 -1
- package/examples/medior.n3 +1 -1
- package/examples/n3-speaks-for-itself.n3 +1 -1
- package/examples/odrl-dpv-ehds-risk-ranked.n3 +1 -1
- package/examples/odrl-dpv-healthcare-risk-ranked.n3 +1 -1
- package/examples/odrl-dpv-risk-ranked.n3 +1 -1
- package/examples/odrl-risk-mitigation.n3 +1 -1
- package/examples/odrl-risk.n3 +1 -1
- package/examples/ontology-question-generation.n3 +409 -0
- package/examples/output/act-alarm-bit-interoperability.md +7 -3
- package/examples/output/act-barley-seed-lineage.md +7 -3
- package/examples/output/act-docking-abort.md +7 -3
- package/examples/output/act-gravity-mediator-witness.md +7 -3
- package/examples/output/act-isolation-breach.md +7 -3
- package/examples/output/act-photosynthetic-exciton-transfer.md +7 -3
- package/examples/output/act-sensor-memory-reset.md +7 -3
- package/examples/output/act-tunnel-junction-wake-switch.md +7 -3
- package/examples/output/act-yeast-self-reproduction.md +7 -3
- package/examples/output/annotation.md +6 -0
- package/examples/output/auroracare.md +25 -21
- package/examples/output/backward-recursion.md +5 -0
- package/examples/output/barley-seed-becoming.md +7 -3
- package/examples/output/bmi.md +7 -3
- package/examples/output/builtin-coverage.md +6 -0
- package/examples/output/calidor.md +4 -0
- package/examples/output/collection.md +6 -0
- package/examples/output/complex-matrix-stability.md +7 -3
- package/examples/output/context-association.md +5 -0
- package/examples/output/control-system.md +7 -3
- package/examples/output/deep-taxonomy-10.md +7 -3
- package/examples/output/deep-taxonomy-100.md +7 -3
- package/examples/output/deep-taxonomy-1000.md +7 -3
- package/examples/output/deep-taxonomy-10000.md +7 -3
- package/examples/output/deep-taxonomy-100000.md +7 -3
- package/examples/output/delfour.md +4 -0
- package/examples/output/digital-product-passport.md +4 -0
- package/examples/output/dijkstra-risk-path.md +5 -0
- package/examples/output/easter.md +34 -30
- package/examples/output/eco-route-insight.md +5 -0
- package/examples/output/flandor.md +4 -0
- package/examples/output/french-cities.md +7 -3
- package/examples/output/fundamental-theorem-arithmetic.md +7 -3
- package/examples/output/genetic-algorithm-knapsack.md +4 -0
- package/examples/output/genetic-algorithm.md +4 -0
- package/examples/output/genetic-knapsack-selection.md +5 -0
- package/examples/output/gps.md +7 -3
- package/examples/output/harborsmr.md +7 -3
- package/examples/output/interop-demo.md +4 -0
- package/examples/output/matrix-mechanics.md +4 -0
- package/examples/output/medior.md +4 -0
- package/examples/output/n3-speaks-for-itself.md +4 -0
- package/examples/output/odrl-dpv-ehds-risk-ranked.md +4 -0
- package/examples/output/odrl-dpv-healthcare-risk-ranked.md +4 -0
- package/examples/output/odrl-dpv-risk-ranked.md +4 -0
- package/examples/output/odrl-risk-mitigation.md +4 -0
- package/examples/output/odrl-risk.md +4 -0
- package/examples/output/ontology-question-generation.md +31 -0
- package/examples/output/parcellocker.md +7 -3
- package/examples/output/pn-junction-tunneling.md +4 -0
- package/examples/output/queens.md +4 -0
- package/examples/output/rc-discharge-envelope.md +5 -0
- package/examples/output/rdf-dataset.md +5 -0
- package/examples/output/rdf-message-flow.md +5 -0
- package/examples/output/rdf-messages.md +5 -0
- package/examples/output/resto.md +7 -3
- package/examples/output/school-placement-audit.md +5 -0
- package/examples/output/smoke-arithmetic.md +5 -0
- package/examples/output/sqrt2-cauchy.md +4 -0
- package/examples/output/sqrt2-dedekind.md +4 -0
- package/examples/output/sudoku.md +4 -0
- package/examples/output/transcendental-numbers-stretched.md +4 -0
- package/examples/output/transistor-switch.md +4 -0
- package/examples/output/triple-terms.md +5 -0
- package/examples/output/tunnel-junction-wake-switch-becoming.md +7 -3
- package/examples/output/wind-turbine.md +7 -3
- package/examples/parcellocker.n3 +2 -2
- package/examples/pn-junction-tunneling.n3 +1 -1
- package/examples/queens.n3 +1 -1
- package/examples/rc-discharge-envelope.n3 +1 -1
- package/examples/rdf-dataset.n3 +1 -1
- package/examples/rdf-message-flow.n3 +1 -1
- package/examples/rdf-messages.n3 +1 -1
- package/examples/resto.n3 +4 -4
- package/examples/school-placement-audit.n3 +1 -1
- package/examples/smoke-arithmetic.n3 +1 -1
- package/examples/sqrt2-cauchy.n3 +1 -1
- package/examples/sqrt2-dedekind.n3 +1 -1
- package/examples/sudoku.n3 +5 -5
- package/examples/transcendental-numbers-stretched.n3 +1 -1
- package/examples/transistor-switch.n3 +1 -1
- package/examples/triple-terms.n3 +1 -1
- package/examples/tunnel-junction-wake-switch-becoming.n3 +4 -4
- package/examples/wind-turbine.n3 +4 -4
- package/package.json +1 -1
|
@@ -15,7 +15,7 @@
|
|
|
15
15
|
@prefix arc: <https://example.org/arc#> .
|
|
16
16
|
@prefix log: <http://www.w3.org/2000/10/swap/log#> .
|
|
17
17
|
|
|
18
|
-
:000_md_title log:outputString "# act-alarm-bit-interoperability\n\n" .
|
|
18
|
+
:000_md_title log:outputString "# act-alarm-bit-interoperability\n\n## Source files\n\n- [N3 rules](../act-alarm-bit-interoperability.n3)\n\n" .
|
|
19
19
|
|
|
20
20
|
:case a arc:Case ;
|
|
21
21
|
arc:question "Can the harbor alarm bit be copied between an optical beacon and a relay register, and what exactly can't be done for a quantum-like token?" .
|
|
@@ -160,14 +160,14 @@
|
|
|
160
160
|
{
|
|
161
161
|
:out log:outputString """ACT harbor alarm bit interoperability
|
|
162
162
|
|
|
163
|
-
Answer
|
|
163
|
+
## Answer
|
|
164
164
|
YES for the classical alarm bit.
|
|
165
165
|
NO for universal cloning and unrestricted fan-out of the quantum-like token.
|
|
166
166
|
|
|
167
|
-
Reason Why
|
|
167
|
+
## Reason Why
|
|
168
168
|
The alarm state is modeled as an abstract bit carried by two unlike classical substrates. Because both the optical beacon and the relay register are information media for the same variable, local permutation and copying in both directions are possible. By contrast, the quantum-like token is treated as a superinformation medium, so universal cloning of all of its states is impossible, and unrestricted classical-style fan-out is blocked as well.
|
|
169
169
|
|
|
170
|
-
Check
|
|
170
|
+
## Check
|
|
171
171
|
C1 OK - the optical beacon is an information medium
|
|
172
172
|
C2 OK - the relay register is an information medium
|
|
173
173
|
C3 OK - both substrates encode the same abstract variable: AlarmBit
|
|
@@ -22,7 +22,7 @@
|
|
|
22
22
|
@prefix arc: <https://example.org/arc#> .
|
|
23
23
|
@prefix log: <http://www.w3.org/2000/10/swap/log#> .
|
|
24
24
|
|
|
25
|
-
:000_md_title log:outputString "# act-barley-seed-lineage\n\n" .
|
|
25
|
+
:000_md_title log:outputString "# act-barley-seed-lineage\n\n## Source files\n\n- [N3 rules](../act-barley-seed-lineage.n3)\n\n" .
|
|
26
26
|
|
|
27
27
|
:case a arc:Case ;
|
|
28
28
|
arc:question "Can a barley seed lineage achieve accurate self-reproduction, dormancy, development, and adaptive persistence under no-design laws — and what exactly can't happen when key ingredients are missing?" .
|
|
@@ -540,14 +540,14 @@
|
|
|
540
540
|
{
|
|
541
541
|
:out log:outputString """ACT barley seed lineage — can and can't
|
|
542
542
|
|
|
543
|
-
Answer
|
|
543
|
+
## Answer
|
|
544
544
|
YES for the viable barley lineage.
|
|
545
545
|
NO for the contrast lineages when digital heredity, repair, protected dormancy, or heritable variation are missing.
|
|
546
546
|
|
|
547
|
-
Reason Why
|
|
547
|
+
## Reason Why
|
|
548
548
|
The main lineage can achieve genome copying under no-design laws because its hereditary information is digitally instantiated. It can also pass through protected dormancy, germinate, produce propagules, reproduce accurately, close its life cycle, and adaptively persist under saline selection. But the contrast lineages show the "can't" side: non-digital heredity blocks accurate genome copying under no-design laws, lack of repair blocks accurate self-reproduction, lack of dormancy protection blocks lineage closure through a protected seed phase, and lack of heritable variation blocks adaptive evolution and thus blocks evolvability.
|
|
549
549
|
|
|
550
|
-
Check
|
|
550
|
+
## Check
|
|
551
551
|
C1 OK - no-design laws are assumed
|
|
552
552
|
C2 OK - the viable genome can be copied under no-design laws
|
|
553
553
|
C3 OK - the viable seed can achieve protected dormancy
|
|
@@ -16,7 +16,7 @@
|
|
|
16
16
|
@prefix arc: <https://example.org/arc#> .
|
|
17
17
|
@prefix log: <http://www.w3.org/2000/10/swap/log#> .
|
|
18
18
|
|
|
19
|
-
:000_md_title log:outputString "# act-docking-abort\n\n" .
|
|
19
|
+
:000_md_title log:outputString "# act-docking-abort\n\n## Source files\n\n- [N3 rules](../act-docking-abort.n3)\n\n" .
|
|
20
20
|
|
|
21
21
|
:case a arc:Case ;
|
|
22
22
|
arc:question "Can a docking-abort token be propagated, permuted, measured and audited across unlike classical media, and what exactly can't be done with the quantum authenticity seal?" .
|
|
@@ -263,14 +263,14 @@
|
|
|
263
263
|
{
|
|
264
264
|
:out log:outputString """ACT docking abort token — constructor-theory coverage case
|
|
265
265
|
|
|
266
|
-
Answer
|
|
266
|
+
## Answer
|
|
267
267
|
YES for the classical abort token.
|
|
268
268
|
NO for universal cloning and unrestricted audit fan-out of the quantum seal.
|
|
269
269
|
|
|
270
|
-
Reason Why
|
|
270
|
+
## Reason Why
|
|
271
271
|
The docking-abort token is treated as an abstract information variable carried by unlike classical media: lamp state, PLC register, radio frame, and audit display. Because those substrates are information media for the same variable, the token can be permuted locally, cloned locally, copied across media, measured into an output record, and embedded in serial and parallel task networks. By contrast, the quantum authenticity seal is treated as a superinformation medium, so cloning all of its states is impossible and unrestricted audit fan-out is blocked.
|
|
272
272
|
|
|
273
|
-
Check
|
|
273
|
+
## Check
|
|
274
274
|
C1 OK - the abort lamp is a computation medium
|
|
275
275
|
C2 OK - the abort lamp distinguishes the abort bit
|
|
276
276
|
C3 OK - permutation of the abort bit is possible on the abort lamp
|
|
@@ -16,7 +16,7 @@
|
|
|
16
16
|
@prefix arc: <https://example.org/arc#> .
|
|
17
17
|
@prefix log: <http://www.w3.org/2000/10/swap/log#> .
|
|
18
18
|
|
|
19
|
-
:000_md_title log:outputString "# act-gravity-mediator-witness\n\n" .
|
|
19
|
+
:000_md_title log:outputString "# act-gravity-mediator-witness\n\n## Source files\n\n- [N3 rules](../act-gravity-mediator-witness.n3)\n\n" .
|
|
20
20
|
|
|
21
21
|
:case a arc:Case ;
|
|
22
22
|
arc:question "If two quantum sensors become entangled only through a gravitational mediator, while locality and interoperability hold, what can be concluded, and what can't a purely classical mediator model do?" .
|
|
@@ -211,14 +211,14 @@
|
|
|
211
211
|
{
|
|
212
212
|
:out log:outputString """ACT gravity mediator witness
|
|
213
213
|
|
|
214
|
-
Answer
|
|
214
|
+
## Answer
|
|
215
215
|
YES for the mediator-only witness run.
|
|
216
216
|
NO for a purely classical mediator model under the same mediator-only conditions.
|
|
217
217
|
|
|
218
|
-
Reason Why
|
|
218
|
+
## Reason Why
|
|
219
219
|
The positive run assumes locality and interoperability, excludes direct coupling between the two quantum systems, and records an entanglement witness after interaction through the mediator alone. Under those constructor-theoretic conditions, the mediator must be non-classical, so the run rules out a purely classical mediator model. The contrast run keeps the same locality, interoperability, and mediator-only structure but assigns the mediator a purely classical model. In that case the mediator-only entanglement witness is blocked, so the run cannot support the same non-classicality conclusion.
|
|
220
220
|
|
|
221
|
-
Check
|
|
221
|
+
## Check
|
|
222
222
|
C1 OK - locality is assumed in the positive run
|
|
223
223
|
C2 OK - interoperability is assumed in the positive run
|
|
224
224
|
C3 OK - direct coupling between the two quantum systems is excluded
|
|
@@ -17,7 +17,7 @@
|
|
|
17
17
|
@prefix arc: <https://example.org/arc#> .
|
|
18
18
|
@prefix log: <http://www.w3.org/2000/10/swap/log#> .
|
|
19
19
|
|
|
20
|
-
:000_md_title log:outputString "# act-isolation-breach\n\n" .
|
|
20
|
+
:000_md_title log:outputString "# act-isolation-breach\n\n## Source files\n\n- [N3 rules](../act-isolation-breach.n3)\n\n" .
|
|
21
21
|
|
|
22
22
|
:case a arc:Case ;
|
|
23
23
|
arc:question "Can an isolation-breach token be prepared, permuted, copied, measured, and audited across unlike classical media, and what exactly can't be done with the quantum provenance seal?" .
|
|
@@ -327,14 +327,14 @@
|
|
|
327
327
|
{
|
|
328
328
|
:out log:outputString """ACT isolation-breach token — broad constructor-theory coverage case
|
|
329
329
|
|
|
330
|
-
Answer
|
|
330
|
+
## Answer
|
|
331
331
|
YES for the classical isolation-breach token.
|
|
332
332
|
NO for universal cloning and unrestricted fan-out of the quantum provenance seal.
|
|
333
333
|
|
|
334
|
-
Reason Why
|
|
334
|
+
## Reason Why
|
|
335
335
|
The isolation-breach token is treated as an abstract information variable carried by unlike classical media: a door beacon, a containment PLC, a nurse pager, and an incident board. Because those substrates are information media for the same variable, the token can be prepared, permuted, reversed, cloned locally, copied across media, measured into an output record, and composed into serial and parallel task networks. By contrast, the specimen seal is treated as a superinformation medium, so cloning all of its states is impossible and unrestricted parallel fan-out is blocked.
|
|
336
336
|
|
|
337
|
-
Check
|
|
337
|
+
## Check
|
|
338
338
|
C1 OK - the door beacon is an information medium
|
|
339
339
|
C2 OK - the containment PLC is an information medium
|
|
340
340
|
C3 OK - the nurse pager is an information medium
|
|
@@ -22,7 +22,7 @@
|
|
|
22
22
|
@prefix arc: <https://example.org/arc#> .
|
|
23
23
|
@prefix log: <http://www.w3.org/2000/10/swap/log#> .
|
|
24
24
|
|
|
25
|
-
:000_md_title log:outputString "# act-photosynthetic-exciton-transfer\n\n" .
|
|
25
|
+
:000_md_title log:outputString "# act-photosynthetic-exciton-transfer\n\n## Source files\n\n- [N3 rules](../act-photosynthetic-exciton-transfer.n3)\n\n" .
|
|
26
26
|
|
|
27
27
|
:case a arc:Case ;
|
|
28
28
|
arc:question "Can a tuned photosynthetic antenna deliver excitation efficiently to a reaction center by short-lived quantum-assisted transfer, while a detuned contrast complex cannot?" .
|
|
@@ -225,14 +225,14 @@
|
|
|
225
225
|
{
|
|
226
226
|
:out log:outputString """ACT photosynthetic exciton transfer
|
|
227
227
|
|
|
228
|
-
Answer
|
|
228
|
+
## Answer
|
|
229
229
|
YES for the tuned antenna complex.
|
|
230
230
|
NO for the detuned, strongly decohered contrast complex.
|
|
231
231
|
|
|
232
|
-
Reason Why
|
|
232
|
+
## Reason Why
|
|
233
233
|
The tuned complex can sample exciton pathways coherently, use vibronically assisted transfer, and exploit short-lived quantum assistance along a downhill route to the reaction center. That makes efficient exciton transfer and reaction-center delivery possible in this case. The detuned contrast complex lacks the same alignment: coherent pathway sampling is blocked, vibronic assistance is unavailable, and the energy landscape is mismatched, so efficient reaction-center delivery is not possible in the same operating picture.
|
|
234
234
|
|
|
235
|
-
Check
|
|
235
|
+
## Check
|
|
236
236
|
C1 OK - the tuned complex can sample exciton pathways coherently
|
|
237
237
|
C2 OK - the tuned complex can use vibronically assisted transfer
|
|
238
238
|
C3 OK - short-lived quantum assistance is enough in the tuned downhill regime
|
|
@@ -19,7 +19,7 @@
|
|
|
19
19
|
@prefix arc: <https://example.org/arc#> .
|
|
20
20
|
@prefix log: <http://www.w3.org/2000/10/swap/log#> .
|
|
21
21
|
|
|
22
|
-
:000_md_title log:outputString "# act-sensor-memory-reset\n\n" .
|
|
22
|
+
:000_md_title log:outputString "# act-sensor-memory-reset\n\n## Source files\n\n- [N3 rules](../act-sensor-memory-reset.n3)\n\n" .
|
|
23
23
|
|
|
24
24
|
:case a arc:Case ;
|
|
25
25
|
arc:question "Can a radiation sensor's alarm memory be reliably reset with a battery pack, and can the same reset be done using only an ambient heat bath?" .
|
|
@@ -170,14 +170,14 @@
|
|
|
170
170
|
{
|
|
171
171
|
:out log:outputString """ACT sensor memory reset
|
|
172
172
|
|
|
173
|
-
Answer
|
|
173
|
+
## Answer
|
|
174
174
|
YES with the battery pack.
|
|
175
175
|
NO with the ambient heat bath alone.
|
|
176
176
|
|
|
177
|
-
Reason Why
|
|
177
|
+
## Reason Why
|
|
178
178
|
The alarm latch is a one-bit memory that must be reset to its standard clear state before the radiation sensor can be reused. In this case, the charged battery pack is treated as a work medium, so it can drive a controlled reset and prepare the latch in its reusable standard state. The ambient bath is treated as a heat medium, so by itself it cannot perform the same reliable directed reset. The example also shows an irreversibility pattern: useful work can be degraded into dissipated heat during reset, but the ambient heat bath alone cannot reconstruct the charged work resource.
|
|
179
179
|
|
|
180
|
-
Check
|
|
180
|
+
## Check
|
|
181
181
|
C1 OK - the battery pack can drive a controlled reset
|
|
182
182
|
C2 OK - the alarm latch can be reliably reset from work
|
|
183
183
|
C3 OK - the latch can be prepared in its standard reusable state
|
|
@@ -18,7 +18,7 @@
|
|
|
18
18
|
@prefix arc: <https://example.org/arc#> .
|
|
19
19
|
@prefix log: <http://www.w3.org/2000/10/swap/log#> .
|
|
20
20
|
|
|
21
|
-
:000_md_title log:outputString "# act-tunnel-junction-wake-switch\n\n" .
|
|
21
|
+
:000_md_title log:outputString "# act-tunnel-junction-wake-switch\n\n## Source files\n\n- [N3 rules](../act-tunnel-junction-wake-switch.n3)\n\n" .
|
|
22
22
|
|
|
23
23
|
:case a arc:Case ;
|
|
24
24
|
arc:question "Can a tunnel-junction wake switch trigger a low-bias leak alarm in a regime where a conventional PN junction cannot?" .
|
|
@@ -204,14 +204,14 @@
|
|
|
204
204
|
{
|
|
205
205
|
:out log:outputString """ACT tunnel-junction wake switch
|
|
206
206
|
|
|
207
|
-
Answer
|
|
207
|
+
## Answer
|
|
208
208
|
YES for the tunnel junction.
|
|
209
209
|
NO for the conventional low-bias PN junction in the same wake-switch regime.
|
|
210
210
|
|
|
211
|
-
Reason Why
|
|
211
|
+
## Reason Why
|
|
212
212
|
The tunnel junction is modeled as a heavily doped narrow PN junction with overlapping states, so quantum barrier transfer is possible. That makes sub-threshold current possible in the low-forward-bias regime, which in turn makes ultra-low-bias switching possible for the wake circuit. Because the device is also scanned through a peak-to-valley window, a negative differential response is possible as well. By contrast, the conventional junction lacks the structural conditions for the same transfer mode, so it cannot deliver the same low-bias switching task in this case.
|
|
213
213
|
|
|
214
|
-
Check
|
|
214
|
+
## Check
|
|
215
215
|
C1 OK - the tunnel junction can support quantum barrier transfer
|
|
216
216
|
C2 OK - the tunnel junction is classified as tunneling-dominant
|
|
217
217
|
C3 OK - the tunnel junction can deliver sub-threshold current
|
|
@@ -19,7 +19,7 @@
|
|
|
19
19
|
@prefix arc: <https://example.org/arc#> .
|
|
20
20
|
@prefix log: <http://www.w3.org/2000/10/swap/log#> .
|
|
21
21
|
|
|
22
|
-
:000_md_title log:outputString "# act-yeast-self-reproduction\n\n" .
|
|
22
|
+
:000_md_title log:outputString "# act-yeast-self-reproduction\n\n## Source files\n\n- [N3 rules](../act-yeast-self-reproduction.n3)\n\n" .
|
|
23
23
|
|
|
24
24
|
:case a arc:Case ;
|
|
25
25
|
arc:question "Can a yeast starter culture self-reproduce accurately under no-design laws, and what exactly can't happen for a non-digital contrast lineage?" .
|
|
@@ -225,14 +225,14 @@
|
|
|
225
225
|
{
|
|
226
226
|
:out log:outputString """ACT yeast self-reproduction
|
|
227
227
|
|
|
228
|
-
Answer
|
|
228
|
+
## Answer
|
|
229
229
|
YES for the viable starter culture.
|
|
230
230
|
NO for accurate self-reproduction in the non-digital contrast lineage.
|
|
231
231
|
|
|
232
|
-
Reason Why
|
|
232
|
+
## Reason Why
|
|
233
233
|
The starter genome is treated as a replicator storing digital hereditary information, while the cell machinery is treated as the vehicle that enables metabolism and copying support. Under no-design laws, digital information makes accurate genome copying possible. Because the replicator is accurate and paired with a vehicle, the whole starter cell qualifies as a self-reproducer. With a variation source and a selection environment, natural selection also becomes possible. By contrast, the non-digital lineage cannot support accurate genome copying under the same no-design-laws assumption, so it cannot sustain the same accurate self-reproduction or natural-selection story.
|
|
234
234
|
|
|
235
|
-
Check
|
|
235
|
+
## Check
|
|
236
236
|
C1 OK - no-design laws are assumed
|
|
237
237
|
C2 OK - digital information is physically instantiated for the viable lineage
|
|
238
238
|
C3 OK - a viable replicator is present
|
package/examples/annotation.n3
CHANGED
|
@@ -8,5 +8,5 @@
|
|
|
8
8
|
|
|
9
9
|
|
|
10
10
|
# Markdown rendering via log:outputString.
|
|
11
|
-
:__md_output :text "# annotation\n" .
|
|
11
|
+
:__md_output :text "# annotation\n\n## Source files\n\n- [N3 rules](../annotation.n3)\n- [Input TriG](../input/annotation.trig)\n\n" .
|
|
12
12
|
{ :__md_output :text ?text } log:query { :__md_output log:outputString ?text } .
|
package/examples/auroracare.n3
CHANGED
|
@@ -350,19 +350,19 @@
|
|
|
350
350
|
# Emit one complete output block per scenario to avoid ordering issues between
|
|
351
351
|
# separately derived log:outputString facts.
|
|
352
352
|
|
|
353
|
-
:out_000_intro log:outputString "# auroracare\n\nAuroraCare — Purpose-based Medical Data Exchange\n\n" .
|
|
353
|
+
:out_000_intro log:outputString "# auroracare\n\n## Source files\n\n- [N3 rules](../auroracare.n3)\n\nAuroraCare — Purpose-based Medical Data Exchange\n\n" .
|
|
354
354
|
|
|
355
355
|
{ :scenario_A :decision "PERMIT" . } => {
|
|
356
356
|
:out_010_A log:outputString """## A – Primary care visit
|
|
357
357
|
Clinician in the patient's care team accessing the patient summary for primary care management.
|
|
358
358
|
|
|
359
|
-
Answer
|
|
359
|
+
## Answer
|
|
360
360
|
PERMIT
|
|
361
361
|
|
|
362
|
-
Reason Why
|
|
362
|
+
## Reason Why
|
|
363
363
|
Permitted: clinician in the patient's care team, and the primary-care policy matched.
|
|
364
364
|
|
|
365
|
-
Check
|
|
365
|
+
## Check
|
|
366
366
|
C1 SKIPPED - not a prohibited purpose
|
|
367
367
|
C2 OK - clinician
|
|
368
368
|
C3 OK - care-team linked
|
|
@@ -381,13 +381,13 @@ C10 INFO - matched policy: urn:policy:primary-care-001
|
|
|
381
381
|
:out_020_B log:outputString """## B – Quality improvement (in scope)
|
|
382
382
|
QI analyst using lab results + summary in a secure environment.
|
|
383
383
|
|
|
384
|
-
Answer
|
|
384
|
+
## Answer
|
|
385
385
|
PERMIT
|
|
386
386
|
|
|
387
|
-
Reason Why
|
|
387
|
+
## Reason Why
|
|
388
388
|
Permitted: ODRL/DPV policy matched for secondary use.
|
|
389
389
|
|
|
390
|
-
Check
|
|
390
|
+
## Check
|
|
391
391
|
C1 SKIPPED - not a prohibited purpose
|
|
392
392
|
C2 SKIPPED
|
|
393
393
|
C3 SKIPPED
|
|
@@ -406,13 +406,13 @@ C10 INFO - matched policy: urn:policy:qi-2025-aurora
|
|
|
406
406
|
:out_030_C log:outputString """## C – Quality improvement (out of scope)
|
|
407
407
|
QI analyst with only lab results; policy expects labs + summary.
|
|
408
408
|
|
|
409
|
-
Answer
|
|
409
|
+
## Answer
|
|
410
410
|
DENY
|
|
411
411
|
|
|
412
|
-
Reason Why
|
|
412
|
+
## Reason Why
|
|
413
413
|
Denied: no policy matched (purpose, environment, TOMs, or categories out of scope).
|
|
414
414
|
|
|
415
|
-
Check
|
|
415
|
+
## Check
|
|
416
416
|
C1 SKIPPED - not a prohibited purpose
|
|
417
417
|
C2 SKIPPED
|
|
418
418
|
C3 SKIPPED
|
|
@@ -431,13 +431,13 @@ C10 SKIPPED - no matched policy
|
|
|
431
431
|
:out_040_D log:outputString """## D – Insurance management
|
|
432
432
|
Insurance bot attempting to use health data for insurance management (prohibited purpose).
|
|
433
433
|
|
|
434
|
-
Answer
|
|
434
|
+
## Answer
|
|
435
435
|
DENY
|
|
436
436
|
|
|
437
|
-
Reason Why
|
|
437
|
+
## Reason Why
|
|
438
438
|
Denied: the requested purpose (insurance management) is prohibited by policy.
|
|
439
439
|
|
|
440
|
-
Check
|
|
440
|
+
## Check
|
|
441
441
|
C1 OK - denied prohibited purpose
|
|
442
442
|
C2 SKIPPED
|
|
443
443
|
C3 SKIPPED
|
|
@@ -456,13 +456,13 @@ C10 SKIPPED - no matched policy
|
|
|
456
456
|
:out_050_E log:outputString """## E – GP checks labs
|
|
457
457
|
GP for the same patient checking lab results via the API gateway.
|
|
458
458
|
|
|
459
|
-
Answer
|
|
459
|
+
## Answer
|
|
460
460
|
PERMIT
|
|
461
461
|
|
|
462
|
-
Reason Why
|
|
462
|
+
## Reason Why
|
|
463
463
|
Permitted: clinician in the patient's care team, and the primary-care policy matched.
|
|
464
464
|
|
|
465
|
-
Check
|
|
465
|
+
## Check
|
|
466
466
|
C1 SKIPPED - not a prohibited purpose
|
|
467
467
|
C2 OK - clinician
|
|
468
468
|
C3 OK - care-team linked
|
|
@@ -481,13 +481,13 @@ C10 INFO - matched policy: urn:policy:primary-care-001
|
|
|
481
481
|
:out_060_F log:outputString """## F – Research on anonymised dataset
|
|
482
482
|
Researcher using anonymised labs + summary in a secure environment, with opt-in.
|
|
483
483
|
|
|
484
|
-
Answer
|
|
484
|
+
## Answer
|
|
485
485
|
PERMIT
|
|
486
486
|
|
|
487
|
-
Reason Why
|
|
487
|
+
## Reason Why
|
|
488
488
|
Permitted: subject opted in and an ODRL/DPV policy matched (anonymised dataset in secure environment).
|
|
489
489
|
|
|
490
|
-
Check
|
|
490
|
+
## Check
|
|
491
491
|
C1 SKIPPED - not a prohibited purpose
|
|
492
492
|
C2 SKIPPED
|
|
493
493
|
C3 SKIPPED
|
|
@@ -506,13 +506,13 @@ C10 INFO - matched policy: urn:policy:research-aurora-diabetes
|
|
|
506
506
|
:out_070_G log:outputString """## G – AI training (opt-out)
|
|
507
507
|
Data user wants to train AI, but the subject opted out of AI training.
|
|
508
508
|
|
|
509
|
-
Answer
|
|
509
|
+
## Answer
|
|
510
510
|
DENY
|
|
511
511
|
|
|
512
|
-
Reason Why
|
|
512
|
+
## Reason Why
|
|
513
513
|
Denied: you opted out of your data being used to train AI systems.
|
|
514
514
|
|
|
515
|
-
Check
|
|
515
|
+
## Check
|
|
516
516
|
C1 SKIPPED - not a prohibited purpose
|
|
517
517
|
C2 SKIPPED
|
|
518
518
|
C3 SKIPPED
|
|
@@ -11,5 +11,5 @@
|
|
|
11
11
|
|
|
12
12
|
|
|
13
13
|
# Markdown rendering via log:outputString.
|
|
14
|
-
:__md_output :text "# backward-recursion\n\n@prefix : <urn:example#> .\n\n:a :reaches :b .\n:a :reaches :c .\n" .
|
|
14
|
+
:__md_output :text "# backward-recursion\n\n## Source files\n\n- [N3 rules](../backward-recursion.n3)\n- [Input TriG](../input/backward-recursion.trig)\n\n@prefix : <urn:example#> .\n\n:a :reaches :b .\n:a :reaches :c .\n" .
|
|
15
15
|
{ :__md_output :text ?text } log:query { :__md_output log:outputString ?text } .
|
|
@@ -21,7 +21,7 @@
|
|
|
21
21
|
@prefix arc: <https://example.org/arc#> .
|
|
22
22
|
@prefix log: <http://www.w3.org/2000/10/swap/log#> .
|
|
23
23
|
|
|
24
|
-
:000_md_title log:outputString "# barley-seed-becoming\n\n" .
|
|
24
|
+
:000_md_title log:outputString "# barley-seed-becoming\n\n## Source files\n\n- [N3 rules](../barley-seed-becoming.n3)\n\n" .
|
|
25
25
|
|
|
26
26
|
:case a arc:Case ;
|
|
27
27
|
arc:question "Can a barley seed lineage become a self-renewing and adaptively persistent cycle under no-design laws — and what blocks that becoming when digital heredity, repair, protected dormancy, or variation are missing?" .
|
|
@@ -472,14 +472,14 @@
|
|
|
472
472
|
{
|
|
473
473
|
:out log:outputString """Barley seed lineage — becoming
|
|
474
474
|
|
|
475
|
-
Answer
|
|
475
|
+
## Answer
|
|
476
476
|
YES for the viable barley lineage.
|
|
477
477
|
NO for the contrast lineages when digital heredity, repair, protected dormancy, or heritable variation are missing.
|
|
478
478
|
|
|
479
|
-
Reason Why
|
|
479
|
+
## Reason Why
|
|
480
480
|
The main lineage can be read as a becoming: a protected dormant seed can germinate, an adult plant can become a next seed stage, and the lineage can therefore become a self-renewing cycle. Because its hereditary information is digitally instantiated and repair is available, it can also become an accurately reproduced next generation under no-design laws. And because heritable variation is present under a matching selection environment, it can become an adaptively persistent lineage. The contrast lineages mark blocked becomings: non-digital heredity blocks accurate copying, lack of repair blocks reliable renewal, lack of dormancy protection blocks closure through the seed phase, and lack of heritable variation blocks adaptive becoming.
|
|
481
481
|
|
|
482
|
-
Check
|
|
482
|
+
## Check
|
|
483
483
|
B1 OK - no-design laws are assumed
|
|
484
484
|
B2 OK - the viable genome can become accurately copied
|
|
485
485
|
B3 OK - the viable seed can become a protected dormant phase
|
package/examples/bmi.n3
CHANGED
|
@@ -15,7 +15,7 @@
|
|
|
15
15
|
@prefix math: <http://www.w3.org/2000/10/swap/math#> .
|
|
16
16
|
@prefix string: <http://www.w3.org/2000/10/swap/string#> .
|
|
17
17
|
|
|
18
|
-
:000_md_title log:outputString "# bmi\n\n" .
|
|
18
|
+
:000_md_title log:outputString "# bmi\n\n## Source files\n\n- [N3 rules](../bmi.n3)\n\n" .
|
|
19
19
|
|
|
20
20
|
# --------------
|
|
21
21
|
# Editable input
|
|
@@ -198,15 +198,15 @@
|
|
|
198
198
|
:Check :c9 ?C9.
|
|
199
199
|
(
|
|
200
200
|
"BMI — ARC-style Body Mass Index example\n\n"
|
|
201
|
-
"Answer\n"
|
|
201
|
+
"## Answer\n"
|
|
202
202
|
"BMI = " ?BmiRounded "\n"
|
|
203
203
|
"Category = " ?Category "\n"
|
|
204
204
|
"At height " ?CmRounded " cm, a healthy-weight range is about " ?HealthyMinRounded "–" ?HealthyMaxRounded " kg (BMI 18.5–24.9).\n\n"
|
|
205
|
-
"Reason Why\n"
|
|
205
|
+
"## Reason Why\n"
|
|
206
206
|
"BMI is defined as weight in kilograms divided by height in meters squared. "
|
|
207
207
|
"This program first normalizes the input to SI units, computes BMI, and then applies WHO adult categories as half-open intervals. "
|
|
208
208
|
"The healthy-weight band is the weight range at the same height that corresponds to BMI 18.5 through 24.9.\n\n"
|
|
209
|
-
"Check\n"
|
|
209
|
+
"## Check\n"
|
|
210
210
|
"C1 " ?C1 "\n"
|
|
211
211
|
"C2 " ?C2 "\n"
|
|
212
212
|
"C3 " ?C3 "\n"
|
|
@@ -69,5 +69,5 @@
|
|
|
69
69
|
|
|
70
70
|
|
|
71
71
|
# Markdown rendering via log:outputString.
|
|
72
|
-
:__md_output :text "# builtin-coverage\n" .
|
|
72
|
+
:__md_output :text "# builtin-coverage\n\n## Source files\n\n- [N3 rules](../builtin-coverage.n3)\n- [Input TriG](../input/builtin-coverage.trig)\n\n" .
|
|
73
73
|
{ :__md_output :text ?text } log:query { :__md_output log:outputString ?text } .
|
package/examples/calidor.n3
CHANGED
|
@@ -419,7 +419,7 @@
|
|
|
419
419
|
# ARC rendering through log:outputString
|
|
420
420
|
# --------------------------------------
|
|
421
421
|
|
|
422
|
-
:out01 log:outputString "# calidor\n\n## Answer\n" .
|
|
422
|
+
:out01 log:outputString "# calidor\n\n## Source files\n\n- [N3 rules](../calidor.n3)\n\n## Answer\n" .
|
|
423
423
|
|
|
424
424
|
{
|
|
425
425
|
:case :recommendedPackage ?pkg .
|
package/examples/collection.n3
CHANGED
|
@@ -4,5 +4,5 @@ _:b2 :p :q .
|
|
|
4
4
|
|
|
5
5
|
|
|
6
6
|
# Markdown rendering via log:outputString.
|
|
7
|
-
:__md_output :text "# collection\n" .
|
|
7
|
+
:__md_output :text "# collection\n\n## Source files\n\n- [N3 rules](../collection.n3)\n- [Input TriG](../input/collection.trig)\n\n" .
|
|
8
8
|
{ :__md_output :text ?text } log:query { :__md_output log:outputString ?text } .
|
|
@@ -17,7 +17,7 @@
|
|
|
17
17
|
@prefix math: <http://www.w3.org/2000/10/swap/math#> .
|
|
18
18
|
@prefix string: <http://www.w3.org/2000/10/swap/string#> .
|
|
19
19
|
|
|
20
|
-
:000_md_title log:outputString "# complex-matrix-stability\n\n" .
|
|
20
|
+
:000_md_title log:outputString "# complex-matrix-stability\n\n## Source files\n\n- [N3 rules](../complex-matrix-stability.n3)\n\n" .
|
|
21
21
|
|
|
22
22
|
# --------------
|
|
23
23
|
# Editable input
|
|
@@ -256,7 +256,7 @@
|
|
|
256
256
|
"Complex Matrix Stability — ARC-style
|
|
257
257
|
|
|
258
258
|
"
|
|
259
|
-
"Answer
|
|
259
|
+
"## Answer
|
|
260
260
|
"
|
|
261
261
|
"We compare three diagonal 2x2 complex matrices for discrete-time stability: "
|
|
262
262
|
"A_unstable = " ?MuS ", A_stable = " ?MsS ", and A_damped = " ?MdS ". "
|
|
@@ -264,7 +264,7 @@
|
|
|
264
264
|
"So A_unstable is unstable, A_stable is marginally stable, and A_damped is damped.
|
|
265
265
|
|
|
266
266
|
"
|
|
267
|
-
"Reason Why
|
|
267
|
+
"## Reason Why
|
|
268
268
|
"
|
|
269
269
|
"For a discrete-time linear system x_{k+1} = A x_k, the eigenvalues of A govern the behaviour of the modes. "
|
|
270
270
|
"Because these matrices are diagonal, the eigenvalues are just the diagonal entries. "
|
|
@@ -273,7 +273,7 @@
|
|
|
273
273
|
"Here the diagonal entries give radii 2, 1, and 0 respectively, which explains the three classifications.
|
|
274
274
|
|
|
275
275
|
"
|
|
276
|
-
"Check
|
|
276
|
+
"## Check
|
|
277
277
|
"
|
|
278
278
|
"C1 " ?C1 "
|
|
279
279
|
"
|
|
@@ -46,6 +46,6 @@
|
|
|
46
46
|
}
|
|
47
47
|
=>
|
|
48
48
|
{
|
|
49
|
-
:report log:outputString "# Context association\n\n## Entailment\nThe RDF dataset associates Bob's data graph with a Data Integrity proof graph and a second metadata proof graph.\n\n## Explanation\nThe input TriG names three graph contexts. The data graph states Bob's name. The signature graph links to that data graph with a proof and records an ecdsa-rdfc-2019 Data Integrity proof from the university issuer. The metadata graph then signs the signature graph itself, giving a chained context association.".
|
|
49
|
+
:report log:outputString "# Context association\n\n## Source files\n\n- [N3 rules](../context-association.n3)\n- [Input TriG](../input/context-association.trig)\n\n## Entailment\nThe RDF dataset associates Bob's data graph with a Data Integrity proof graph and a second metadata proof graph.\n\n## Explanation\nThe input TriG names three graph contexts. The data graph states Bob's name. The signature graph links to that data graph with a proof and records an ecdsa-rdfc-2019 Data Integrity proof from the university issuer. The metadata graph then signs the signature graph itself, giving a chained context association.".
|
|
50
50
|
}.
|
|
51
51
|
|
|
@@ -13,7 +13,7 @@
|
|
|
13
13
|
@prefix string: <http://www.w3.org/2000/10/swap/string#>.
|
|
14
14
|
@prefix : <https://example.org/control-system#>.
|
|
15
15
|
|
|
16
|
-
:000_md_title log:outputString "# control-system\n\n" .
|
|
16
|
+
:000_md_title log:outputString "# control-system\n\n## Source files\n\n- [N3 rules](../control-system.n3)\n\n" .
|
|
17
17
|
|
|
18
18
|
# -----
|
|
19
19
|
# Facts
|
|
@@ -157,11 +157,11 @@
|
|
|
157
157
|
:feedbackDifferential ?FBDiff.
|
|
158
158
|
(
|
|
159
159
|
"Control System — ARC explanation of two control signals\n\n"
|
|
160
|
-
"Answer\n"
|
|
160
|
+
"## Answer\n"
|
|
161
161
|
?Answer "\n"
|
|
162
162
|
"Actuator 1 command: " ?A1 "\n"
|
|
163
163
|
"Actuator 2 command: " ?A2 "\n\n"
|
|
164
|
-
"Reason Why\n"
|
|
164
|
+
"## Reason Why\n"
|
|
165
165
|
"The first sensor pair is " ?Low " and " ?High ", so the reading is " ?Trend
|
|
166
166
|
" and the controller normalizes the gap " ?Gap " into " ?Norm ". "
|
|
167
167
|
"That normalized value creates a feedforward term of " ?FFProp
|
|
@@ -171,7 +171,7 @@
|
|
|
171
171
|
"The observed state is " ?DiffErr " relative units below the measured output, so the differential correction is negative. "
|
|
172
172
|
"That yields a proportional feedback part of " ?FBProp ", a nonlinear factor of " ?FBFactor
|
|
173
173
|
", and a differential contribution of " ?FBDiff ". Together they produce actuator 2 command " ?A2 ".\n\n"
|
|
174
|
-
"Check\n"
|
|
174
|
+
"## Check\n"
|
|
175
175
|
"C1 OK - the first sensor pair is rising, so the normalization uses the rising-branch rule.\n"
|
|
176
176
|
"C2 OK - the normalized measurement is positive and smaller than the raw gap, which is consistent with a square-root normalization.\n"
|
|
177
177
|
"C3 OK - actuator 1 is lower than its proportional feedforward term because disturbance compensation is subtracted.\n"
|
|
@@ -31,7 +31,7 @@
|
|
|
31
31
|
|
|
32
32
|
@prefix log: <http://www.w3.org/2000/10/swap/log#>.
|
|
33
33
|
|
|
34
|
-
:000_md_title log:outputString "# deep-taxonomy-10\n\n" .
|
|
34
|
+
:000_md_title log:outputString "# deep-taxonomy-10\n\n## Source files\n\n- [N3 rules](../deep-taxonomy-10.n3)\n\n" .
|
|
35
35
|
|
|
36
36
|
# ARC checks
|
|
37
37
|
{ :ind a :N0. }
|
|
@@ -61,13 +61,13 @@
|
|
|
61
61
|
{
|
|
62
62
|
:report log:outputString "Deep Taxonomy - deep classification benchmark
|
|
63
63
|
|
|
64
|
-
Answer
|
|
64
|
+
## Answer
|
|
65
65
|
The test succeeds: starting from one individual classified as N0, the rules eventually classify it as N10 and then as A2.
|
|
66
66
|
|
|
67
|
-
Reason Why
|
|
67
|
+
## Reason Why
|
|
68
68
|
Each rule moves the same individual one level deeper in the taxonomy and also adds two side labels. Because that chain continues all the way from N0 to N10, the final rule deriving A2 fires, and that in turn makes the test true.
|
|
69
69
|
|
|
70
|
-
Check
|
|
70
|
+
## Check
|
|
71
71
|
C1 OK - the starting classification N0 is present.
|
|
72
72
|
C2 OK - the first expansion produced N1 together with side labels I1 and J1.
|
|
73
73
|
C3 OK - the chain reaches the midpoint N5 and still carries both side-label branches.
|
|
@@ -121,7 +121,7 @@
|
|
|
121
121
|
|
|
122
122
|
@prefix log: <http://www.w3.org/2000/10/swap/log#>.
|
|
123
123
|
|
|
124
|
-
:000_md_title log:outputString "# deep-taxonomy-100\n\n" .
|
|
124
|
+
:000_md_title log:outputString "# deep-taxonomy-100\n\n## Source files\n\n- [N3 rules](../deep-taxonomy-100.n3)\n\n" .
|
|
125
125
|
|
|
126
126
|
# ARC checks
|
|
127
127
|
{ :ind a :N0. }
|
|
@@ -151,13 +151,13 @@
|
|
|
151
151
|
{
|
|
152
152
|
:report log:outputString "Deep Taxonomy - deep classification benchmark
|
|
153
153
|
|
|
154
|
-
Answer
|
|
154
|
+
## Answer
|
|
155
155
|
The test succeeds: starting from one individual classified as N0, the rules eventually classify it as N100 and then as A2.
|
|
156
156
|
|
|
157
|
-
Reason Why
|
|
157
|
+
## Reason Why
|
|
158
158
|
Each rule moves the same individual one level deeper in the taxonomy and also adds two side labels. Because that chain continues all the way from N0 to N100, the final rule deriving A2 fires, and that in turn makes the test true.
|
|
159
159
|
|
|
160
|
-
Check
|
|
160
|
+
## Check
|
|
161
161
|
C1 OK - the starting classification N0 is present.
|
|
162
162
|
C2 OK - the first expansion produced N1 together with side labels I1 and J1.
|
|
163
163
|
C3 OK - the chain reaches the midpoint N50 and still carries both side-label branches.
|
|
@@ -1021,7 +1021,7 @@
|
|
|
1021
1021
|
|
|
1022
1022
|
@prefix log: <http://www.w3.org/2000/10/swap/log#>.
|
|
1023
1023
|
|
|
1024
|
-
:000_md_title log:outputString "# deep-taxonomy-1000\n\n" .
|
|
1024
|
+
:000_md_title log:outputString "# deep-taxonomy-1000\n\n## Source files\n\n- [N3 rules](../deep-taxonomy-1000.n3)\n\n" .
|
|
1025
1025
|
|
|
1026
1026
|
# ARC checks
|
|
1027
1027
|
{ :ind a :N0. }
|
|
@@ -1051,13 +1051,13 @@
|
|
|
1051
1051
|
{
|
|
1052
1052
|
:report log:outputString "Deep Taxonomy - deep classification benchmark
|
|
1053
1053
|
|
|
1054
|
-
Answer
|
|
1054
|
+
## Answer
|
|
1055
1055
|
The test succeeds: starting from one individual classified as N0, the rules eventually classify it as N1000 and then as A2.
|
|
1056
1056
|
|
|
1057
|
-
Reason Why
|
|
1057
|
+
## Reason Why
|
|
1058
1058
|
Each rule moves the same individual one level deeper in the taxonomy and also adds two side labels. Because that chain continues all the way from N0 to N1000, the final rule deriving A2 fires, and that in turn makes the test true.
|
|
1059
1059
|
|
|
1060
|
-
Check
|
|
1060
|
+
## Check
|
|
1061
1061
|
C1 OK - the starting classification N0 is present.
|
|
1062
1062
|
C2 OK - the first expansion produced N1 together with side labels I1 and J1.
|
|
1063
1063
|
C3 OK - the chain reaches the midpoint N500 and still carries both side-label branches.
|