eyeling 1.24.5 → 1.24.7

package/see/examples/output/gps.md

@@ -1,102 +0,0 @@
-# GPS route planning  
-
-## Entailment  
-Take the direct route via Brugge.  
-Recommended route: Gent -> Brugge -> Oostende  
-
-## Explanation  
-From Gent to Oostende, the planner found two routes in this small map. The direct route (Gent -> Brugge -> Oostende) takes 2400 seconds at cost 0.01, with belief 0.9408 and comfort 0.99. The alternative (Gent -> Kortrijk -> Brugge -> Oostende) takes 4100 seconds at cost 0.018, with belief 0.903168 and comfort 0.9801. So the direct route is faster, cheaper, more reliable, and slightly more comfortable.  
-
-**Generated derivation support**  
-
-Compiled support: 8 source fact(s), 7 rule(s), fixpoint reached before rendering.  
-
-Derivation steps:  
-- Rule 3: :i1 :location :Gent; (:Gent :Oostende ?Acts ?Dur ?Cost ?Bel ?Comf) :path true => :i1 gps:path (?Acts ?Dur ?Cost ?Bel ?Comf) derives :i1 gps:path ((:drive_gent_brugge :drive_brugge_oostende) 2400 0.01 0.9408 0.99) ., :i1 gps:path ((:drive_gent_kortrijk :drive_kortrijk_brugge :drive_brugge_oostende) 4100 0.018 0.903168 0.9801) .  
-  - Uses: :i1 :location :Gent . _(source)_  
-- Rule 4 (1 premise pattern(s) => 4 conclusion pattern(s)) derives :routeDirect :duration 2400 ., :routeDirect :cost 0.01 ., :routeDirect :belief 0.9408 ., :routeDirect :comfort 0.99 .  
-  - Uses: :i1 gps:path ((:drive_gent_brugge :drive_brugge_oostende) 2400 0.01 0.9408 0.99) . _(derived)_  
-- Rule 5 (1 premise pattern(s) => 4 conclusion pattern(s)) derives :routeViaKortrijk :duration 4100 ., :routeViaKortrijk :cost 0.018 ., :routeViaKortrijk :belief 0.903168 ., :routeViaKortrijk :comfort 0.9801 .  
-  - Uses: :i1 gps:path ((:drive_gent_kortrijk :drive_kortrijk_brugge :drive_brugge_oostende) 4100 0.018 0.903168 0.9801) . _(derived)_  
-- Rule 6 (12 premise pattern(s) => 2 conclusion pattern(s)) derives :decision :recommendedRoute :routeDirect ., :decision :outcome "Take the direct route via Brugge." .  
-  - Uses: :routeDirect :duration 2400 . _(derived)_; :routeDirect :cost 0.01 . _(derived)_; :routeDirect :belief 0.9408 . _(derived)_; :routeDirect :comfort 0.99 . _(derived)_; … +4 more premise fact(s)  
-- Rule 7 (13 premise pattern(s) => 1 conclusion pattern(s)) derives :report log:outputString "[authored report]" .  
-  - Uses: :decision :recommendedRoute :routeDirect . _(derived)_; :decision :outcome "Take the direct route via Brugge." . _(derived)_; :routeDirect :label "Gent -> Brugge -> Oostende" . _(source)_; :routeDirect :duration 2400 . _(derived)_; … +8 more premise fact(s)  
-
-Selected explanation support:  
-  - :report log:outputString "[authored report]" . _(authored report, Rule 7)_  
-  - :decision :outcome "Take the direct route via Brugge." . _(derived by Rule 6)_  
-    - :routeDirect :duration 2400 . _(derived by Rule 4)_  
-      - :i1 gps:path ((:drive_gent_brugge :drive_brugge_oostende) 2400 0.01 0.9408 0.99) . _(derived by Rule 3)_  
-        - :i1 :location :Gent . _(source)_  
-    - :routeDirect :cost 0.01 . _(derived by Rule 4)_  
-      - :i1 gps:path ((:drive_gent_brugge :drive_brugge_oostende) 2400 0.01 0.9408 0.99) . _(derived by Rule 3)_  
-        - :i1 :location :Gent . _(source)_  
-    - :routeDirect :belief 0.9408 . _(derived by Rule 4)_  
-      - :i1 gps:path ((:drive_gent_brugge :drive_brugge_oostende) 2400 0.01 0.9408 0.99) . _(derived by Rule 3)_  
-        - :i1 :location :Gent . _(source)_  
-    - :routeDirect :comfort 0.99 . _(derived by Rule 4)_  
-      - :i1 gps:path ((:drive_gent_brugge :drive_brugge_oostende) 2400 0.01 0.9408 0.99) . _(derived by Rule 3)_  
-        - :i1 :location :Gent . _(source)_  
-    - ... 4 more premise fact(s)  
-  - :decision :recommendedRoute :routeDirect . _(derived by Rule 6)_  
-    - :routeDirect :duration 2400 . _(derived by Rule 4)_  
-      - :i1 gps:path ((:drive_gent_brugge :drive_brugge_oostende) 2400 0.01 0.9408 0.99) . _(derived by Rule 3)_  
-        - :i1 :location :Gent . _(source)_  
-    - :routeDirect :cost 0.01 . _(derived by Rule 4)_  
-      - :i1 gps:path ((:drive_gent_brugge :drive_brugge_oostende) 2400 0.01 0.9408 0.99) . _(derived by Rule 3)_  
-        - :i1 :location :Gent . _(source)_  
-    - :routeDirect :belief 0.9408 . _(derived by Rule 4)_  
-      - :i1 gps:path ((:drive_gent_brugge :drive_brugge_oostende) 2400 0.01 0.9408 0.99) . _(derived by Rule 3)_  
-        - :i1 :location :Gent . _(source)_  
-    - :routeDirect :comfort 0.99 . _(derived by Rule 4)_  
-      - :i1 gps:path ((:drive_gent_brugge :drive_brugge_oostende) 2400 0.01 0.9408 0.99) . _(derived by Rule 3)_  
-        - :i1 :location :Gent . _(source)_  
-    - ... 4 more premise fact(s)  
-  - :routeViaKortrijk :comfort 0.9801 . _(derived by Rule 5)_  
-    - :i1 gps:path ((:drive_gent_kortrijk :drive_kortrijk_brugge :drive_brugge_oostende) 4100 0.018 0.903168 0.9801) . _(derived by Rule 3)_  
-      - :i1 :location :Gent . _(source)_  
-
-## Formal TriG Output  
-
-```trig  
-@prefix log: <http://www.w3.org/2000/10/swap/log#> .  
-@prefix math: <http://www.w3.org/2000/10/swap/math#> .  
-@prefix list: <http://www.w3.org/2000/10/swap/list#> .  
-@prefix string: <http://www.w3.org/2000/10/swap/string#> .  
-@prefix gps: <https://eyereasoner.github.io/see/examples/gps#> .  
-@prefix : <https://eyereasoner.github.io/see/examples/gps#> .  
-@prefix see: <https://example.org/see#> .  
-@prefix in: <https://example.org/see/input#> .  
-@prefix rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#> .  
-
-:i1 gps:path ((:drive_gent_brugge :drive_brugge_oostende) 2400 0.01 0.9408 0.99) .  
-:i1 gps:path ((:drive_gent_kortrijk :drive_kortrijk_brugge :drive_brugge_oostende) 4100 0.018 0.903168 0.9801) .  
-:routeDirect :duration 2400 .  
-:routeDirect :cost 0.01 .  
-:routeDirect :belief 0.9408 .  
-:routeDirect :comfort 0.99 .  
-:routeViaKortrijk :duration 4100 .  
-:routeViaKortrijk :cost 0.018 .  
-:routeViaKortrijk :belief 0.903168 .  
-:routeViaKortrijk :comfort 0.9801 .  
-:decision :recommendedRoute :routeDirect .  
-:decision :outcome "Take the direct route via Brugge." .  
-:report log:outputString "=== Answer ===\nTake the direct route via Brugge.\nRecommended route: Gent -> Brugge -> Oostende\n\n=== Explanation ===\nFrom Gent to Oostende, the planner found two routes in this small map. The direct route (Gent -> Brugge -> Oostende) takes 2400 seconds at cost 0.01, with belief 0.9408 and comfort 0.99. The alternative (Gent -> Kortrijk -> Brugge -> Oostende) takes 4100 seconds at cost 0.018, with belief 0.903168 and comfort 0.9801. So the direct route is faster, cheaper, more reliable, and slightly more comfortable." .  
-
-in:metadata {  
-  in:run a see:InputDataset .  
-  in:run see:name "gps" .  
-  in:run see:title "GPS route planning" .  
-  in:run see:sourceFile "examples/n3/gps.n3" .  
-  in:run see:sourceSHA256 "3ca7a57d4a2d06215e852e74b51d71f6b0aa36230eb172fa3e17465052c06404" .  
-  in:run see:description "Goal-driven path planning over a tiny western-Belgium map. The N3 source is\nadapted from Eyeling's GPS example and compiles to a standalone SEE example." .  
-  in:run see:compiler "see.js N3-to-JS compiler" .  
-  in:run see:inputFacts 8 .  
-  in:run see:compiledRules 5 .  
-  in:run see:compiledBackwardRules 2 .  
-  in:run see:compiledFuses 4 .  
-  in:run see:compiledQueries 0 .  
-}  
-```  
-

package/see/examples/output/gray_code_counter.md

@@ -1,68 +0,0 @@
-# Gray Code Counter  
-
-## Entailment  
-bits : 4  
-states visited : 16  
-unique states : 16  
-sequence prefix : 0000, 0001, 0011, 0010, 0110, 0111, 0101, 0100  
-wrap transition : 1000 -> 0000  
-maximum adjacent Hamming distance : 1  
-
-## Explanation  
-The counter maps each integer n to n xor (n >> 1), which is the reflected binary Gray-code construction. For 4 bits, the first 16 integers cover the full state space without duplicates. The Hamming-distance comparison compares each state with the next state, including the final wraparound transition. A valid cyclic Gray counter therefore changes exactly one bit at every step.  
-
-**Generated derivation support**  
-
-Compiled support: 7 source fact(s), 3 rule(s), fixpoint reached before rendering.  
-
-Derivation steps:  
-- Rule 1: :Counter :sequence ?Sequence; ?Sequence list:length ?Visited => :Counter :statesVisited ?Visited derives :Counter :statesVisited 16 .  
-  - Uses: :Counter :sequence (0 1 3 2 6 7 5 4 12 13 15 14 10 11 9 8) . _(source)_  
-- Rule 2 (4 premise pattern(s) => 1 conclusion pattern(s)) derives :Counter :validGrayCycle true .  
-  - Uses: :Counter :steps 16 . _(source)_; :Counter :statesVisited 16 . _(derived)_; :Counter :uniqueStateCount 16 . _(source)_; :Counter :maxHammingDistance 1 . _(source)_  
-- Rule 3 (8 premise pattern(s) => 1 conclusion pattern(s)) derives :report log:outputString "[authored report]" .  
-  - Uses: :Counter :bits 4 . _(source)_; :Counter :statesVisited 16 . _(derived)_; :Counter :uniqueStateCount 16 . _(source)_; :Counter :sequencePrefix "0000, 0001, 0011, 0010, 0110, 0111, 0101, 0100" . _(source)_; … +3 more premise fact(s)  
-
-Selected explanation support:  
-  - :report log:outputString "[authored report]" . _(authored report, Rule 3)_  
-  - :Counter :validGrayCycle true . _(derived by Rule 2)_  
-    - :Counter :steps 16 . _(source)_  
-    - :Counter :statesVisited 16 . _(derived by Rule 1)_  
-      - :Counter :sequence (0 1 3 2 6 7 5 4 12 13 15 14 10 11 9 8) . _(source)_  
-    - :Counter :uniqueStateCount 16 . _(source)_  
-    - :Counter :maxHammingDistance 1 . _(source)_  
-  - :Counter :statesVisited 16 . _(derived by Rule 1)_  
-    - :Counter :sequence (0 1 3 2 6 7 5 4 12 13 15 14 10 11 9 8) . _(source)_  
-
-## Formal TriG Output  
-
-```trig  
-@prefix : <https://eyereasoner.github.io/see/examples/gray-code-counter#> .  
-@prefix list: <http://www.w3.org/2000/10/swap/list#> .  
-@prefix log: <http://www.w3.org/2000/10/swap/log#> .  
-@prefix math: <http://www.w3.org/2000/10/swap/math#> .  
-@prefix string: <http://www.w3.org/2000/10/swap/string#> .  
-@prefix see: <https://example.org/see#> .  
-@prefix in: <https://example.org/see/input#> .  
-@prefix rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#> .  
-
-:Counter :statesVisited 16 .  
-:Counter :validGrayCycle true .  
-:report log:outputString "=== Answer ===\nbits : 4\nstates visited : 16\nunique states : 16\nsequence prefix : 0000, 0001, 0011, 0010, 0110, 0111, 0101, 0100\nwrap transition : 1000 -> 0000\nmaximum adjacent Hamming distance : 1\n\n=== Explanation ===\nThe counter maps each integer n to n xor (n >> 1), which is the reflected binary Gray-code construction. For 4 bits, the first 16 integers cover the full state space without duplicates. The Hamming-distance comparison compares each state with the next state, including the final wraparound transition. A valid cyclic Gray counter therefore changes exactly one bit at every step." .  
-
-in:metadata {  
-  in:run a see:InputDataset .  
-  in:run see:name "gray_code_counter" .  
-  in:run see:title "Gray Code Counter" .  
-  in:run see:sourceFile "examples/n3/gray_code_counter.n3" .  
-  in:run see:sourceSHA256 "61f77dc563c8a38d612cf4fba812e6066f00449e27b9bc620e866a52e08ea4d2" .  
-  in:run see:description "N3-compiled version of the 4-bit Gray counter SEE example.  The example keeps\nthe known reflected Gray-code sequence as data, derives its visited-state count\nwith a list builtin, and derives the published invariants before rendering the\nSEE report." .  
-  in:run see:compiler "see.js N3-to-JS compiler" .  
-  in:run see:inputFacts 7 .  
-  in:run see:compiledRules 3 .  
-  in:run see:compiledBackwardRules 0 .  
-  in:run see:compiledFuses 0 .  
-  in:run see:compiledQueries 0 .  
-}  
-```  
-

package/see/examples/output/greatest_lower_bound_uniqueness.md

@@ -1,60 +0,0 @@
-# In a partial order, a greatest lower bound is unique.  
-
-## Entailment  
-The compiled query selected 2 fact(s) after the rule closure was computed.  
-Main entailment: **:result :sameGreatestLowerBound (:a :b :g2 :g1).**  
-
-Selected entailments:  
-- :result :sameGreatestLowerBound (:a :b :g2 :g1) .  
-- :result :sameGreatestLowerBound (:a :b :g1 :g2) .  
-
-## Explanation  
-Starts with 6 source fact(s), applies 7 rule(s), and reaches a fixpoint.  
-The log:query projection then keeps only the matching fact(s) shown above.  
-
-Derivation steps:  
-- Rule 1: ?x :inP true => ?x :leq ?x derives :a :leq :a ., :b :leq :b ., :g1 :leq :g1 ., :g2 :leq :g2 .  
-  - Uses: :a :inP true . _(source)_; :b :inP true . _(source)_; :g1 :inP true . _(source)_; :g2 :inP true . _(source)_  
-- Rule 3: ?x :leq ?y; ?y :leq ?x => (?x ?y) :sameTerm true derives (:a :a) :sameTerm true ., (:b :b) :sameTerm true ., (:g1 :g1) :sameTerm true ., (:g2 :g2) :sameTerm true ., … +2 more  
-  - Uses: :a :leq :a . _(derived)_; :b :leq :b . _(derived)_; :g1 :leq :g1 . _(derived)_; :g2 :leq :g2 . _(derived)_; … +2 more premise fact(s)  
-- Rule 5 (1 premise pattern(s) => 3 conclusion pattern(s)) derives :g1 :lowerBoundOf (:a :b) ., :g1 :leq :a ., :g1 :leq :b ., :g2 :lowerBoundOf (:a :b) ., … +2 more  
-  - Uses: :g1 :glbOf (:a :b) . _(source)_; :g2 :glbOf (:a :b) . _(source)_  
-- Rule 6: ?m :glbOf (?a ?b); ?l :lowerBoundOf (?a ?b) => ?l :leq ?m derives :g2 :leq :g1 ., :g1 :leq :g2 .  
-  - Uses: :g1 :glbOf (:a :b) . _(source)_; :g2 :lowerBoundOf (:a :b) . _(derived)_; :g2 :glbOf (:a :b) . _(source)_; :g1 :lowerBoundOf (:a :b) . _(derived)_  
-- Rule 7 (3 premise pattern(s) => 1 conclusion pattern(s)) derives (:a :b :g1 :g1) :sameGlb true ., (:a :b :g2 :g2) :sameGlb true ., (:a :b :g1 :g2) :sameGlb true ., (:a :b :g2 :g1) :sameGlb true .  
-  - Uses: :g1 :glbOf (:a :b) . _(source)_; (:g1 :g1) :sameTerm true . _(derived)_; :g2 :glbOf (:a :b) . _(source)_; (:g2 :g2) :sameTerm true . _(derived)_; … +2 more premise fact(s)  
-
-Selected explanation support:  
-  - :result :sameGreatestLowerBound (:a :b :g2 :g1) . _(no recorded rule support)_  
-  - :result :sameGreatestLowerBound (:a :b :g1 :g2) . _(no recorded rule support)_  
-
-The query-selected facts are serialized in the Formal TriG Output section.  
-
-## Formal TriG Output  
-
-```trig  
-@prefix : <https://eyereasoner.github.io/eye/reasoning#> .  
-@prefix log: <http://www.w3.org/2000/10/swap/log#> .  
-@prefix see: <https://example.org/see#> .  
-@prefix in: <https://example.org/see/input#> .  
-@prefix rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#> .  
-
-:result :sameGreatestLowerBound (:a :b :g1 :g2) .  
-:result :sameGreatestLowerBound (:a :b :g2 :g1) .  
-
-in:metadata {  
-  in:run a see:InputDataset .  
-  in:run see:name "greatest_lower_bound_uniqueness" .  
-  in:run see:title "In a partial order, a greatest lower bound is unique." .  
-  in:run see:sourceFile "examples/n3/greatest_lower_bound_uniqueness.n3" .  
-  in:run see:sourceSHA256 "3a199585b9906a895deba6508458c88551558aec89fdc1b490ed9493bbb63433" .  
-  in:run see:description "" .  
-  in:run see:compiler "see.js N3-to-JS compiler" .  
-  in:run see:inputFacts 6 .  
-  in:run see:compiledRules 7 .  
-  in:run see:compiledBackwardRules 0 .  
-  in:run see:compiledFuses 0 .  
-  in:run see:compiledQueries 1 .  
-}  
-```  
-

package/see/examples/output/group_inverse_uniqueness.md

@@ -1,60 +0,0 @@
-# In a group, the inverse of an element is unique.  
-
-## Entailment  
-The compiled query selected 2 fact(s) after the rule closure was computed.  
-Main entailment: **:result :sameInverse (:x :j :i).**  
-
-Selected entailments:  
-- :result :sameInverse (:x :j :i) .  
-- :result :sameInverse (:x :i :j) .  
-
-## Explanation  
-Starts with 6 source fact(s), applies 6 rule(s), and reaches a fixpoint.  
-The log:query projection then keeps only the matching fact(s) shown above.  
-
-Derivation steps:  
-- Rule 3: ?a :inG true => (:e ?a) :mul ?a derives (:e :x) :mul :x ., (:e :i) :mul :i ., (:e :j) :mul :j ., (:e :e) :mul :e .  
-  - Uses: :x :inG true . _(source)_; :i :inG true . _(source)_; :j :inG true . _(source)_; :e :inG true . _(source)_  
-- Rule 4: ?a :inG true => (?a :e) :mul ?a derives (:x :e) :mul :x ., (:i :e) :mul :i ., (:j :e) :mul :j .  
-  - Uses: :x :inG true . _(source)_; :i :inG true . _(source)_; :j :inG true . _(source)_  
-- Rule 5 (3 premise pattern(s) => 2 conclusion pattern(s)) derives (:x :i) :mul :e ., (:i :x) :mul :e ., (:x :j) :mul :e ., (:j :x) :mul :e .  
-  - Uses: :x :inG true . _(source)_; :i :inG true . _(source)_; :i :inverseOf :x . _(source)_; :j :inG true . _(source)_; … +1 more premise fact(s)  
-- Rule 1 (4 premise pattern(s) => 1 conclusion pattern(s)) derives (:x :x) :sameTerm true ., (:e :e) :sameTerm true ., (:i :i) :sameTerm true ., (:j :j) :sameTerm true ., … +2 more  
-  - Uses: (:e :x) :mul :x . _(derived)_; (:x :e) :mul :x . _(derived)_; (:x :i) :mul :e . _(derived)_; (:e :e) :mul :e . _(derived)_; … +7 more premise fact(s)  
-- Rule 6 (3 premise pattern(s) => 1 conclusion pattern(s)) derives (:x :i :i) :sameInverse true ., (:x :i :j) :sameInverse true ., (:x :j :i) :sameInverse true ., (:x :j :j) :sameInverse true .  
-  - Uses: :i :inverseOf :x . _(source)_; (:i :i) :sameTerm true . _(derived)_; :j :inverseOf :x . _(source)_; (:i :j) :sameTerm true . _(derived)_; … +2 more premise fact(s)  
-
-Selected explanation support:  
-  - :result :sameInverse (:x :j :i) . _(no recorded rule support)_  
-  - :result :sameInverse (:x :i :j) . _(no recorded rule support)_  
-
-The query-selected facts are serialized in the Formal TriG Output section.  
-
-## Formal TriG Output  
-
-```trig  
-@prefix : <https://eyereasoner.github.io/eye/reasoning#> .  
-@prefix log: <http://www.w3.org/2000/10/swap/log#> .  
-@prefix see: <https://example.org/see#> .  
-@prefix in: <https://example.org/see/input#> .  
-@prefix rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#> .  
-
-:result :sameInverse (:x :i :j) .  
-:result :sameInverse (:x :j :i) .  
-
-in:metadata {  
-  in:run a see:InputDataset .  
-  in:run see:name "group_inverse_uniqueness" .  
-  in:run see:title "In a group, the inverse of an element is unique." .  
-  in:run see:sourceFile "examples/n3/group_inverse_uniqueness.n3" .  
-  in:run see:sourceSHA256 "956bff60a7e087600d31b0fce180031de1e03f7a995b3f2949e531653b7b5dc3" .  
-  in:run see:description "" .  
-  in:run see:compiler "see.js N3-to-JS compiler" .  
-  in:run see:inputFacts 6 .  
-  in:run see:compiledRules 6 .  
-  in:run see:compiledBackwardRules 0 .  
-  in:run see:compiledFuses 0 .  
-  in:run see:compiledQueries 1 .  
-}  
-```  
-