eyeling 1.24.7 → 1.24.9

package/examples/calidor.n3

@@ -419,7 +419,7 @@
 # ARC rendering through log:outputString
 # --------------------------------------
 
-:out01 log:outputString "=== Answer ===\n" .
+:out01 log:outputString "# calidor\n\n## Source files\n\n- [N3 rules](../calidor.n3)\n\n## Answer\n" .
 
 {
     :case :recommendedPackage ?pkg .
@@ -441,7 +441,7 @@
     :out06 log:outputString ?line .
 } .
 
-:out07 log:outputString "\n=== Reason Why ===\n" .
+:out07 log:outputString "\n## Reason Why\n" .
 :out08 log:outputString "The gateway desensitizes local heat, vulnerability, and prepaid-energy stress into an expiring municipal support insight, and the city consumes that envelope only for heatwave response.\n" .
 :out09 log:outputString "metric               : active_need_count\n" .
 
@@ -485,7 +485,7 @@
     :out17 log:outputString ?line .
 } .
 
-:out18 log:outputString "\n=== Check ===\n" .
+:out18 log:outputString "\n## Check\n" .
 
 { :check :signatureVerifies true . } => { :out19 log:outputString "signature verifies              : yes\n" . } .
 { :check :payloadHashMatches true . } => { :out20 log:outputString "payload hash matches            : yes\n" . } .

package/examples/collection.n3

@@ -1,3 +1,8 @@
 @prefix : <https://eyereasoner.github.io/eyeling/examples/collection#>.
 (1 _:b2 (2)) :p2 :q2 .
 _:b2 :p :q .
+
+
+# Markdown rendering via log:outputString.
+:__md_output :text "# collection\n\n## Source files\n\n- [N3 rules](../collection.n3)\n- [Input TriG](../input/collection.trig)\n\n" .
+{ :__md_output :text ?text } log:query { :__md_output log:outputString ?text } .

package/examples/complex-matrix-stability.n3

@@ -17,6 +17,8 @@
 @prefix math: <http://www.w3.org/2000/10/swap/math#> .
 @prefix string: <http://www.w3.org/2000/10/swap/string#> .
 
+:000_md_title log:outputString "# complex-matrix-stability\n\n## Source files\n\n- [N3 rules](../complex-matrix-stability.n3)\n\n" .
+
 # --------------
 # Editable input
 # --------------
@@ -254,7 +256,7 @@
     "Complex Matrix Stability — ARC-style
 
 "
-    "Answer
+    "## Answer
 "
     "We compare three diagonal 2x2 complex matrices for discrete-time stability: "
     "A_unstable = " ?MuS ", A_stable = " ?MsS ", and A_damped = " ?MdS ". "
@@ -262,7 +264,7 @@
     "So A_unstable is unstable, A_stable is marginally stable, and A_damped is damped.
 
 "
-    "Reason Why
+    "## Reason Why
 "
     "For a discrete-time linear system x_{k+1} = A x_k, the eigenvalues of A govern the behaviour of the modes. "
     "Because these matrices are diagonal, the eigenvalues are just the diagonal entries. "
@@ -271,7 +273,7 @@
     "Here the diagonal entries give radii 2, 1, and 0 respectively, which explains the three classifications.
 
 "
-    "Check
+    "## Check
 "
     "C1 " ?C1 "
 "

package/examples/context-association.n3

@@ -46,14 +46,6 @@
 }
 =>
 {
-  :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.".
+  :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.".
 }.
 
-# query
-{
-  :association ?P ?O.
-}
-log:query
-{
-  :association ?P ?O.
-}.

package/examples/control-system.n3

@@ -13,6 +13,8 @@
 @prefix string: <http://www.w3.org/2000/10/swap/string#>.
 @prefix : <https://example.org/control-system#>.
 
+:000_md_title log:outputString "# control-system\n\n## Source files\n\n- [N3 rules](../control-system.n3)\n\n" .
+
 # -----
 # Facts
 # -----
@@ -155,11 +157,11 @@
        :feedbackDifferential ?FBDiff.
   (
     "Control System — ARC explanation of two control signals\n\n"
-    "Answer\n"
+    "## Answer\n"
     ?Answer "\n"
     "Actuator 1 command: " ?A1 "\n"
     "Actuator 2 command: " ?A2 "\n\n"
-    "Reason Why\n"
+    "## Reason Why\n"
     "The first sensor pair is " ?Low " and " ?High ", so the reading is " ?Trend
     " and the controller normalizes the gap " ?Gap " into " ?Norm ". "
     "That normalized value creates a feedforward term of " ?FFProp
@@ -169,7 +171,7 @@
     "The observed state is " ?DiffErr " relative units below the measured output, so the differential correction is negative. "
     "That yields a proportional feedback part of " ?FBProp ", a nonlinear factor of " ?FBFactor
     ", and a differential contribution of " ?FBDiff ". Together they produce actuator 2 command " ?A2 ".\n\n"
-    "Check\n"
+    "## Check\n"
     "C1 OK - the first sensor pair is rising, so the normalization uses the rising-branch rule.\n"
     "C2 OK - the normalized measurement is positive and smaller than the raw gap, which is consistent with a square-root normalization.\n"
     "C3 OK - actuator 1 is lower than its proportional feedforward term because disturbance compensation is subtracted.\n"

package/examples/deep-taxonomy-10.n3

@@ -31,6 +31,8 @@
 
 @prefix log: <http://www.w3.org/2000/10/swap/log#>.
 
+:000_md_title log:outputString "# deep-taxonomy-10\n\n## Source files\n\n- [N3 rules](../deep-taxonomy-10.n3)\n\n" .
+
 # ARC checks
 { :ind a :N0. }
     => { :arc :check1 "C1 OK - the starting classification N0 is present." . } .
@@ -59,13 +61,13 @@
 {
     :report log:outputString "Deep Taxonomy - deep classification benchmark
 
-Answer
+## Answer
 The test succeeds: starting from one individual classified as N0, the rules eventually classify it as N10 and then as A2.
 
-Reason Why
+## Reason Why
 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.
 
-Check
+## Check
 C1 OK - the starting classification N0 is present.
 C2 OK - the first expansion produced N1 together with side labels I1 and J1.
 C3 OK - the chain reaches the midpoint N5 and still carries both side-label branches.

package/examples/deep-taxonomy-100.n3

@@ -121,6 +121,8 @@
 
 @prefix log: <http://www.w3.org/2000/10/swap/log#>.
 
+:000_md_title log:outputString "# deep-taxonomy-100\n\n## Source files\n\n- [N3 rules](../deep-taxonomy-100.n3)\n\n" .
+
 # ARC checks
 { :ind a :N0. }
     => { :arc :check1 "C1 OK - the starting classification N0 is present." . } .
@@ -149,13 +151,13 @@
 {
     :report log:outputString "Deep Taxonomy - deep classification benchmark
 
-Answer
+## Answer
 The test succeeds: starting from one individual classified as N0, the rules eventually classify it as N100 and then as A2.
 
-Reason Why
+## Reason Why
 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.
 
-Check
+## Check
 C1 OK - the starting classification N0 is present.
 C2 OK - the first expansion produced N1 together with side labels I1 and J1.
 C3 OK - the chain reaches the midpoint N50 and still carries both side-label branches.

package/examples/deep-taxonomy-1000.n3

@@ -1021,6 +1021,8 @@
 
 @prefix log: <http://www.w3.org/2000/10/swap/log#>.
 
+:000_md_title log:outputString "# deep-taxonomy-1000\n\n## Source files\n\n- [N3 rules](../deep-taxonomy-1000.n3)\n\n" .
+
 # ARC checks
 { :ind a :N0. }
     => { :arc :check1 "C1 OK - the starting classification N0 is present." . } .
@@ -1049,13 +1051,13 @@
 {
     :report log:outputString "Deep Taxonomy - deep classification benchmark
 
-Answer
+## Answer
 The test succeeds: starting from one individual classified as N0, the rules eventually classify it as N1000 and then as A2.
 
-Reason Why
+## Reason Why
 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.
 
-Check
+## Check
 C1 OK - the starting classification N0 is present.
 C2 OK - the first expansion produced N1 together with side labels I1 and J1.
 C3 OK - the chain reaches the midpoint N500 and still carries both side-label branches.

package/examples/deep-taxonomy-10000.n3

@@ -10021,6 +10021,8 @@
 
 @prefix log: <http://www.w3.org/2000/10/swap/log#>.
 
+:000_md_title log:outputString "# deep-taxonomy-10000\n\n## Source files\n\n- [N3 rules](../deep-taxonomy-10000.n3)\n\n" .
+
 # ARC checks
 { :ind a :N0. }
     => { :arc :check1 "C1 OK - the starting classification N0 is present." . } .
@@ -10049,13 +10051,13 @@
 {
     :report log:outputString "Deep Taxonomy - deep classification benchmark
 
-Answer
+## Answer
 The test succeeds: starting from one individual classified as N0, the rules eventually classify it as N10000 and then as A2.
 
-Reason Why
+## Reason Why
 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 N10000, the final rule deriving A2 fires, and that in turn makes the test true.
 
-Check
+## Check
 C1 OK - the starting classification N0 is present.
 C2 OK - the first expansion produced N1 together with side labels I1 and J1.
 C3 OK - the chain reaches the midpoint N5000 and still carries both side-label branches.

package/examples/deep-taxonomy-100000.n3

@@ -100022,6 +100022,8 @@
 
 @prefix log: <http://www.w3.org/2000/10/swap/log#>.
 
+:000_md_title log:outputString "# deep-taxonomy-100000\n\n## Source files\n\n- [N3 rules](../deep-taxonomy-100000.n3)\n\n" .
+
 # ARC checks
 { :ind a :N0. }
     => { :arc :check1 "C1 OK - the starting classification N0 is present." . } .
@@ -100048,5 +100050,5 @@
 }
     =>
 {
-    :report log:outputString "Deep Taxonomy - very deep classification benchmark\n\nAnswer\nThe test succeeds: starting from one individual classified as N0, the rules eventually classify it as N100000 and then as A2.\n\nReason Why\nEach 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 N100000, the final rule deriving A2 fires, and that in turn makes the test true.\n\nCheck\nC1 OK - the starting classification N0 is present.\nC2 OK - the first expansion produced N1 together with side labels I1 and J1.\nC3 OK - the chain reaches the midpoint N50000 and still carries both side-label branches.\nC4 OK - the final taxonomy step from N99999 to N100000 was completed.\nC5 OK - once N100000 is reached, the terminal class A2 is derived.\nC6 OK - the success flag is raised only after the terminal class A2 is present.\n" .
+    :report log:outputString "Deep Taxonomy - very deep classification benchmark\n\n## Answer\nThe test succeeds: starting from one individual classified as N0, the rules eventually classify it as N100000 and then as A2.\n\n## Reason Why\nEach 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 N100000, the final rule deriving A2 fires, and that in turn makes the test true.\n\n## Check\nC1 OK - the starting classification N0 is present.\nC2 OK - the first expansion produced N1 together with side labels I1 and J1.\nC3 OK - the chain reaches the midpoint N50000 and still carries both side-label branches.\nC4 OK - the final taxonomy step from N99999 to N100000 was completed.\nC5 OK - once N100000 is reached, the terminal class A2 is derived.\nC6 OK - the success flag is raised only after the terminal class A2 is present.\n" .
 } .

package/examples/delfour.n3

@@ -331,7 +331,7 @@
 # ARC rendering through log:outputString
 # --------------------------------------
 
-:out01 log:outputString "=== Answer ===\n" .
+:out01 log:outputString "# delfour\n\n## Source files\n\n- [N3 rules](../delfour.n3)\n\n## Answer\n" .
 :out02 log:outputString "The scanner is allowed to use a neutral shopping insight and recommends Low-Sugar Tea Biscuits instead of Classic Tea Biscuits.\n" .
 :out03 log:outputString "case                 : delfour\n" .
 :out04 log:outputString "decision             : Allowed\n" .
@@ -345,7 +345,7 @@
     :out06 log:outputString ?line .
 } .
 
-:out07 log:outputString "\n=== Reason Why ===\n" .
+:out07 log:outputString "\n## Reason Why\n" .
 :out08 log:outputString "The phone desensitizes a diabetes-related household condition into a scoped low-sugar need, wraps it in an expiring Insight + Policy envelope, signs it, and the scanner consumes that envelope for shopping assistance.\n" .
 :out09 log:outputString "metric               : sugar_g_per_serving\n" .
 
@@ -396,7 +396,7 @@
     :out18 log:outputString ?line .
 } .
 
-:out19 log:outputString "\n=== Check ===\n" .
+:out19 log:outputString "\n## Check\n" .
 
 { :check :signatureVerifies true . } => { :out20 log:outputString "signature verifies              : yes\n" . } .
 { :check :payloadHashMatches true . } => { :out21 log:outputString "payload hash matches            : yes\n" . } .

package/examples/digital-product-passport.n3

@@ -17,6 +17,8 @@
 @prefix log:    <http://www.w3.org/2000/10/swap/log#> .
 @prefix string: <http://www.w3.org/2000/10/swap/string#> .
 
+:000_md_title log:outputString "# digital-product-passport\n\n## Source files\n\n- [N3 rules](../digital-product-passport.n3)\n\n" .
+
 # --------------------
 # 1) Actors and places
 # --------------------

package/examples/dijkstra-risk-path.n3

@@ -43,10 +43,9 @@
 {
   :Case :selectedPath :pathB; :trustGate :noEnumeratedPathIsLower; :notes :riskCanOutweighRawCost.
   :pathB :routeText ?Route; :rawCost ?Raw; :riskSum ?Risk; :score ?Score; :edgeCount ?Edges.
-  ("=== Answer ===\nselected path : %s\nraw cost : %.2f\nrisk sum : %.2f\nrisk-adjusted score : %.2f\nedges in selected path : %d\n\n=== Explanation ===\nEach edge contributes its delivery cost plus the configured risk penalty. The N3 source enumerates the small graph's simple route candidates and compares the selected route against each alternative score. The selected route balances cost and risk through DepotB and LabD, while the apparently cheaper DepotC path is rejected once risk is priced in." ?Route ?Raw ?Risk ?Score ?Edges) string:format ?Block.
+  ("# dijkstra-risk-path\n\n## Source files\n\n- [N3 rules](../dijkstra-risk-path.n3)\n- [Input TriG](../input/dijkstra-risk-path.trig)\n\n## Answer\nselected path : %s\nraw cost : %.2f\nrisk sum : %.2f\nrisk-adjusted score : %.2f\nedges in selected path : %d\n\n## Explanation\nEach edge contributes its delivery cost plus the configured risk penalty. The N3 source enumerates the small graph's simple route candidates and compares the selected route against each alternative score. The selected route balances cost and risk through DepotB and LabD, while the apparently cheaper DepotC path is rejected once risk is priced in." ?Route ?Raw ?Risk ?Score ?Edges) string:format ?Block.
 } => {
   :dijkstraRiskPath log:outputString ?Block.
   :dijkstraRiskPath :selects :pathB.
 }.
 
-{ :dijkstraRiskPath :selects ?Path } log:query { :dijkstraRiskPath :selects ?Path }.

package/examples/easter.n3

@@ -15,6 +15,8 @@
 @prefix rdfs: <http://www.w3.org/2000/01/rdf-schema#> .
 @prefix xsd: <http://www.w3.org/2001/XMLSchema#> .
 
+:000_md_title log:outputString "# easter\n\n## Source files\n\n- [N3 rules](../easter.n3)\n\n" .
+
 <> rdfs:comment """This ARC-style version keeps the Gregorian computus from the original example and reports, for each sample year, an Answer, a Reason Why, and a set of independent Checks.""" .
 
 :y2026 a :Case; :year 2026 .
@@ -194,14 +196,14 @@
         :check1 ?C1; :check2 ?C2; :check3 ?C3; :check4 ?C4; :check5 ?C5.
   (
     "Easter — Gregorian computus\n\n"
-    "=== " ?Y " ===\n"
-    "Answer\n"
+    "## " ?Y "\n"
+    "## Answer\n"
     "Easter Sunday falls on " ?Month " " ?Day ".\n\n"
-    "Reason Why\n"
+    "## Reason Why\n"
     "For year " ?Y ", the computus gives j=" ?J ", k=" ?K ", q=" ?Q
     ", r=" ?R ", v=" ?V ", and final month/day numbers x=" ?X ", z=" ?Z ". "
     "Because the day is z+1, the resulting Easter date is " ?Month " " ?Day ".\n\n"
-    "Check\n"
+    "## Check\n"
     ?C1 ?C2 ?C3 ?C4 ?C5
   ) string:concatenation ?Block. }
     =>

package/examples/eco-route-insight.n3

@@ -34,10 +34,9 @@
   :Shipment :id ?ShipmentId; :payloadTons ?PayloadTons.
   :Envelope :rawDataExported ?Raw; :payloadDigest ?Digest; :signatureKey ?Key; :signature ?Signature.
   :Policy :fuelIndexThreshold ?Threshold; :signatureAlgorithm ?Algorithm.
-  ("=== Answer ===\ninsight status : issue\nshow eco banner : %s\naudience : %s\nallowed use : %s\nsuggested route : %s\ncurrent fuel index : %.2f\nsuggested fuel index : %.2f\nestimated saving : %.2f\nexpires at : %s\nraw data exported : %s\nsignature algorithm : %s\npayload digest : %s\nsignature key : %s\nsignature : %s\n\n=== Explanation ===\nThe current route uses fuel index = distanceKm × (payloadKg / 1000) × gradientFactor. For %s, Current urban route gives %.2f × %.2f × %.2f = %.2f. The policy threshold is %.2f, so a local eco banner is justified. The selected alternative %s gives %.2f × %.2f × %.2f = %.2f, saving %.2f while staying within the ETA delay limit. The signed envelope exposes audience, use, expiry, route suggestion, and compact fuel indices, but not raw payload, GPS trace, driver behavior, or raw telemetry." ?Show ?Audience ?Use ?AltId ?CurrentIndex ?AltIndex ?Saving ?Expiry ?Raw ?Algorithm ?Digest ?Key ?Signature ?ShipmentId ?CurrentDistance ?PayloadTons ?CurrentGradient ?CurrentIndex ?Threshold ?AltId ?AltDistance ?PayloadTons ?AltGradient ?AltIndex ?Saving) string:format ?Block.
+  ("# eco-route-insight\n\n## Source files\n\n- [N3 rules](../eco-route-insight.n3)\n- [Input TriG](../input/eco-route-insight.trig)\n\n## Answer\ninsight status : issue\nshow eco banner : %s\naudience : %s\nallowed use : %s\nsuggested route : %s\ncurrent fuel index : %.2f\nsuggested fuel index : %.2f\nestimated saving : %.2f\nexpires at : %s\nraw data exported : %s\nsignature algorithm : %s\npayload digest : %s\nsignature key : %s\nsignature : %s\n\n## Explanation\nThe current route uses fuel index = distanceKm × (payloadKg / 1000) × gradientFactor. For %s, Current urban route gives %.2f × %.2f × %.2f = %.2f. The policy threshold is %.2f, so a local eco banner is justified. The selected alternative %s gives %.2f × %.2f × %.2f = %.2f, saving %.2f while staying within the ETA delay limit. The signed envelope exposes audience, use, expiry, route suggestion, and compact fuel indices, but not raw payload, GPS trace, driver behavior, or raw telemetry." ?Show ?Audience ?Use ?AltId ?CurrentIndex ?AltIndex ?Saving ?Expiry ?Raw ?Algorithm ?Digest ?Key ?Signature ?ShipmentId ?CurrentDistance ?PayloadTons ?CurrentGradient ?CurrentIndex ?Threshold ?AltId ?AltDistance ?PayloadTons ?AltGradient ?AltIndex ?Saving) string:format ?Block.
 } => {
   :ecoRouteInsight log:outputString ?Block.
   :ecoRouteInsight :issues :Insight.
 }.
 
-{ :ecoRouteInsight :issues ?Insight } log:query { :ecoRouteInsight :issues ?Insight }.

package/examples/flandor.n3

@@ -371,7 +371,7 @@
 # ARC rendering through log:outputString
 # --------------------------------------
 
-:out01 log:outputString "=== Answer ===\n" .
+:out01 log:outputString "# flandor\n\n## Source files\n\n- [N3 rules](../flandor.n3)\n\n## Answer\n" .
 :out02 log:outputString "Name: Flandor\n" .
 :out03 log:outputString "Region: Flanders\n" .
 :out04 log:outputString "Metric: regional_retooling_priority\n" .
@@ -392,7 +392,7 @@
   ("Envelope HMAC-SHA-256: %s\n" ?sig) string:format ?line .
 } => { :out10 log:outputString ?line . } .
 
-:out11 log:outputString "\n=== Reason Why ===\n" .
+:out11 log:outputString "\n## Reason Why\n" .
 :out12 log:outputString "Export weakness is active because at least one cluster has exportOrdersIndex < 90 (Antwerp chemicals=84, Ghent manufacturing=87).\n" .
 :out13 log:outputString "Skills strain is active because technical vacancy rate is 4.6% (threshold > 3.9%).\n" .
 :out14 log:outputString "Grid stress is active because congestion hours = 19 (threshold > 11).\n" .
@@ -400,7 +400,7 @@
 :out16 log:outputString "Selected package \"Flandor Retooling Pulse\" covers export=true, skills=true, grid=true, cost=€120M.\n" .
 :out17 log:outputString "Usage is permitted only for purpose \"regional_stabilization\" and the envelope expires at 2026-04-08T19:00:00+00:00.\n" .
 
-:out18 log:outputString "\n=== Check ===\n" .
+:out18 log:outputString "\n## Check\n" .
 { :check :payloadHashMatches true . }
   => { :out19 log:outputString "- PASS: payload hash matches\n" . } .
 { :check :hmacMatches true . }

package/examples/french-cities.n3

@@ -14,6 +14,8 @@
 @prefix string: <http://www.w3.org/2000/10/swap/string#>.
 @prefix : <https://example.org/french-cities#>.
 
+:000_md_title log:outputString "# french-cities\n\n## Source files\n\n- [N3 rules](../french-cities.n3)\n\n" .
+
 # ---------------------------------------------------------------------------
 # Facts
 # ---------------------------------------------------------------------------
@@ -128,16 +130,16 @@
   :check :c1 ?C1; :c2 ?C2; :c3 ?C3; :c4 ?C4.
   (
     "French cities — ARC style graph reachability\n\n"
-    "Answer\n"
+    "## Answer\n"
     ?Outcome "\n\n"
-    "Reason Why\n"
+    "## Reason Why\n"
     "The original example says that every :oneway link is also a :path, and that :path is transitive. "
     "So once Angers can reach Nantes directly, longer routes can be built by chaining earlier links. "
     ?Angers " reaches Nantes directly. "
     ?LeMans " reaches Nantes through Angers. "
     ?Chartres " reaches Nantes through Le Mans and Angers. "
     ?Paris " reaches Nantes through Chartres, Le Mans, and Angers.\n\n"
-    "Check\n"
+    "## Check\n"
     "C1 " ?C1 "\n"
     "C2 " ?C2 "\n"
     "C3 " ?C3 "\n"

package/examples/fundamental-theorem-arithmetic.n3

@@ -17,6 +17,8 @@
 @prefix list: <http://www.w3.org/2000/10/swap/list#> .
 @prefix string: <http://www.w3.org/2000/10/swap/string#> .
 
+:000_md_title log:outputString "# fundamental-theorem-arithmetic\n\n## Source files\n\n- [N3 rules](../fundamental-theorem-arithmetic.n3)\n\n" .
+
 # --------------
 # Editable input
 # --------------
@@ -222,17 +224,17 @@ true .
   :Check :c6 ?C6.
   (
     "Fundamental Theorem of Arithmetic — ARC-style\n\n"
-    "Answer\n"
+    "## Answer\n"
     "For n = " ?N ", the prime factors are " ?Flat ", the prime-power form is " ?PrimePower
     ", and the product of these factors is " ?N " with " ?Distinct " distinct primes.\n\n"
-    "Reason Why\n"
+    "## Reason Why\n"
     "Existence in this run comes from repeated smallest-divisor decomposition: " ?N
     " factors as " ?Flat ". Each distinct factor is prime. "
     "For uniqueness up to order, the reverse traversal gives " ?LargestFlat
     ", and both traversals sort to the same multiset of primes. "
     "So this concrete case exhibits the Fundamental Theorem of Arithmetic for " ?N
     ": a prime factorization exists and is unique up to order. The extreme prime factors are " ?Smallest " and " ?Largest ".\n\n"
-    "Check\n"
+    "## Check\n"
     "C1 " ?C1 "\n"
     "C2 " ?C2 "\n"
     "C3 " ?C3 "\n"

package/examples/genetic-algorithm-knapsack.n3

@@ -257,4 +257,4 @@
     ?Best ?Ok ?W ?V ?Gen ) string:format ?Line
 }
 log:query
-{ 1 log:outputString ?Line }.
+{ 0 log:outputString "# genetic-algorithm-knapsack\n\n## Source files\n\n- [N3 rules](../genetic-algorithm-knapsack.n3)\n\n". 1 log:outputString ?Line }.

package/examples/genetic-algorithm.n3

@@ -217,4 +217,4 @@
     string:format ?Line
 }
 log:query
-{ 1 log:outputString ?Line }.
+{ 0 log:outputString "# genetic-algorithm\n\n## Source files\n\n- [N3 rules](../genetic-algorithm.n3)\n\n". 1 log:outputString ?Line }.

package/examples/genetic-knapsack-selection.n3

@@ -23,10 +23,9 @@
   :Run :capacity ?Capacity; :localSearchStopsAt :FinalLocal.
   :FinalLocal :genome ?Genome; :selectedItems ?Items; :weight ?Weight; :value ?Value; :fitness ?Fitness; :generationsEvaluated ?Generations.
   :ExhaustiveOptimum :genome ?OptGenome; :value ?OptValue.
-  ("=== Answer ===\nfinal genome : %s\nselected items : %s\nweight : %d / %d\nvalue : %d\nfitness : %d\ngenerations evaluated : %d\nexhaustive optimum value : %d at genome %s\n\n=== Explanation ===\nEach genome bit says whether the corresponding item is selected for the knapsack. Feasible candidates get fitness 1000000 minus value, so higher value means lower fitness; overweight candidates are penalized above every feasible candidate. The N3 source records the deterministic local-search result and validates that the final genome respects capacity and has no strictly better one-bit neighbor. For transparency, an exhaustive enumeration also records the global best feasible value, showing this is a local mutation search rather than a global-optimality claim." ?Genome ?Items ?Weight ?Capacity ?Value ?Fitness ?Generations ?OptValue ?OptGenome) string:format ?Block.
+  ("# genetic-knapsack-selection\n\n## Source files\n\n- [N3 rules](../genetic-knapsack-selection.n3)\n- [Input TriG](../input/genetic-knapsack-selection.trig)\n\n## Answer\nfinal genome : %s\nselected items : %s\nweight : %d / %d\nvalue : %d\nfitness : %d\ngenerations evaluated : %d\nexhaustive optimum value : %d at genome %s\n\n## Explanation\nEach genome bit says whether the corresponding item is selected for the knapsack. Feasible candidates get fitness 1000000 minus value, so higher value means lower fitness; overweight candidates are penalized above every feasible candidate. The N3 source records the deterministic local-search result and validates that the final genome respects capacity and has no strictly better one-bit neighbor. For transparency, an exhaustive enumeration also records the global best feasible value, showing this is a local mutation search rather than a global-optimality claim." ?Genome ?Items ?Weight ?Capacity ?Value ?Fitness ?Generations ?OptValue ?OptGenome) string:format ?Block.
 } => {
   :geneticKnapsackSelection log:outputString ?Block.
   :geneticKnapsackSelection :selects :FinalLocal.
 }.
 
-{ :geneticKnapsackSelection :selects ?Candidate } log:query { :geneticKnapsackSelection :selects ?Candidate }.

package/examples/gps.n3

@@ -15,6 +15,8 @@
 @prefix gps: <https://example.org/gps#>.
 @prefix : <https://example.org/gps-case#>.
 
+:000_md_title log:outputString "# gps\n\n## Source files\n\n- [N3 rules](../gps.n3)\n\n" .
+
 # -----
 # Facts
 # -----
@@ -105,17 +107,17 @@
   :routeViaKortrijk :label ?AltLabel; :duration ?AltDur; :cost ?AltCost; :belief ?AltBel; :comfort ?AltComf.
   (
     "GPS — Goal driven route planning\n\n"
-    "Answer\n"
+    "## Answer\n"
     ?Outcome "\n"
     "Recommended route: " ?BestLabel "\n\n"
-    "Reason Why\n"
+    "## Reason Why\n"
     "From Gent to Oostende, the planner found two routes in this small map. "
     "The direct route (" ?BestLabel ") takes " ?BestDur " seconds at cost " ?BestCost
     ", with belief " ?BestBel " and comfort " ?BestComf ". "
     "The alternative (" ?AltLabel ") takes " ?AltDur " seconds at cost " ?AltCost
     ", with belief " ?AltBel " and comfort " ?AltComf ". "
     "So the direct route is faster, cheaper, more reliable, and slightly more comfortable.\n\n"
-    "Check\n"
+    "## Check\n"
     "C1 OK - the direct Gent → Brugge → Oostende route was derived.\n"
     "C2 OK - the alternative Gent → Kortrijk → Brugge → Oostende route was derived.\n"
     "C3 OK - the recommended route is faster than the alternative.\n"

package/examples/harborsmr.n3

@@ -22,6 +22,8 @@
 @prefix string: <http://www.w3.org/2000/10/swap/string#> .
 @prefix xsd: <http://www.w3.org/2001/XMLSchema#> .
 
+:000_md_title log:outputString "# harborsmr\n\n## Source files\n\n- [N3 rules](../harborsmr.n3)\n\n" .
+
 # -----
 # Facts
 # -----
@@ -184,14 +186,14 @@
 => {
   :out log:outputString """HarborSMR — bounded flexible-export insight for port electrolysis
 
-Answer
+## Answer
 PERMIT
 The port hydrogen hub may use the SMR insight to run PEM electrolyzer train 2 at 16 MW from 14:00 to 18:00.
 
-Reason Why
+## Reason Why
 The operator shares only a narrow, expiring insight that a temporary 18 MW flexible-export window is available. The request is for electrolysis dispatch only, the requested 16 MW fits inside the permitted window, safety margins are above threshold, no outage blocks the window, and the policy forbids redistribution for market resale. Raw reactor telemetry stays local.
 
-Check
+## Check
 C1  OK - reserve margin exceeds the dispatch threshold
 C2  OK - cooling margin exceeds the dispatch threshold
 C3  OK - no planned outage blocks the window

package/examples/input/ontology-question-generation.trig

@@ -0,0 +1,79 @@
+@prefix ex:   <http://example.org/ontology-question-generation/domain#> .
+@prefix see:  <https://eyereasoner.github.io/eye/reasoning#> .
+@prefix in:   <http://example.org/eyeling/input#> .
+@prefix rdf:  <http://www.w3.org/1999/02/22-rdf-syntax-ns#> .
+@prefix rdfs: <http://www.w3.org/2000/01/rdf-schema#> .
+@prefix owl:  <http://www.w3.org/2002/07/owl#> .
+@prefix xsd:  <http://www.w3.org/2001/XMLSchema#> .
+
+# A tiny ontology containing common OWL/RDFS patterns from which
+# competency questions can be generated.
+
+ex:Person a owl:Class ;
+    rdfs:label "person" .
+
+ex:Organization a owl:Class ;
+    rdfs:label "organization" .
+
+ex:Project a owl:Class ;
+    rdfs:label "project" .
+
+ex:Employee a owl:Class ;
+    rdfs:label "employee" ;
+    rdfs:subClassOf ex:Person ;
+    rdfs:subClassOf [
+        a owl:Restriction ;
+        owl:onProperty ex:worksFor ;
+        owl:someValuesFrom ex:Organization
+    ] ;
+    rdfs:subClassOf [
+        a owl:Restriction ;
+        owl:onProperty ex:assignedTo ;
+        owl:minCardinality 1
+    ] .
+
+ex:worksFor a owl:ObjectProperty ;
+    rdfs:label "works for" ;
+    rdfs:domain ex:Person ;
+    rdfs:range ex:Organization ;
+    owl:inverseOf ex:employs .
+
+ex:employs a owl:ObjectProperty ;
+    rdfs:label "employs" ;
+    rdfs:domain ex:Organization ;
+    rdfs:range ex:Person .
+
+ex:assignedTo a owl:ObjectProperty ;
+    rdfs:label "assigned to" ;
+    rdfs:domain ex:Employee ;
+    rdfs:range ex:Project .
+
+ex:birthDate a owl:DatatypeProperty, owl:FunctionalProperty ;
+    rdfs:label "birth date" ;
+    rdfs:domain ex:Person ;
+    rdfs:range xsd:date .
+
+ex:legalName a owl:DatatypeProperty ;
+    rdfs:label "legal name" ;
+    rdfs:domain ex:Organization ;
+    rdfs:range xsd:string .
+
+ex:Organization owl:disjointWith ex:Person .
+
+ex:principalEmployer rdfs:subPropertyOf ex:worksFor ;
+    rdfs:label "principal employer" .
+
+xsd:date a rdfs:Datatype ;
+    rdfs:label "date" .
+
+xsd:string a rdfs:Datatype ;
+    rdfs:label "string" .
+
+in:metadata {
+    in:run a see:InputDataset .
+    in:run see:name "ontology-question-generation" .
+    in:run see:title "Ontology Question Generation" .
+    in:run see:sourceFile "examples/ontology-question-generation.n3" .
+    in:run see:description "Small OWL/RDFS ontology used to generate Markdown competency questions from ontological patterns." .
+    in:run see:compiler "Eyeling RDF/TriG input sidecar" .
+}