eyeling 1.26.5 → 1.26.7

package/examples/proof/list-iterate.n3

@@ -0,0 +1,142 @@
+@prefix : <urn:example:> .
+@prefix list: <http://www.w3.org/2000/10/swap/list#> .
+@prefix pe: <https://eyereasoner.github.io/pe#> .
+
+("Huey" "Dewey" "Louie") :iterate (0 "Huey") .
+"Dewey" :hasIndex 1 .
+("Huey" "Dewey" "Louie") :iterate (1 "Dewey") .
+("Huey" "Dewey" "Louie") :iterate (2 "Louie") .
+:test :is true .
+
+{ ("Huey" "Dewey" "Louie") :iterate (0 "Huey") . } pe:why {
+  { ("Huey" "Dewey" "Louie") :iterate (0 "Huey") . }
+    pe:by [ pe:rule "list-iterate.n3"; pe:line 11 ];
+    pe:binding
+      [ pe:var "X"; pe:value ("Huey" "Dewey" "Louie") ],
+      [ pe:var "Y"; pe:value (0 "Huey") ],
+      [ pe:var "Z"; pe:value 1 ];
+    pe:uses
+      { :Let :param ("Huey" "Dewey" "Louie") . },
+      { ("Huey" "Dewey" "Louie") list:iterate (0 "Huey") . },
+      { ("Huey" "Dewey" "Louie") list:iterate (1 "Dewey") . },
+      { ("Huey" "Dewey" "Louie") list:iterate (1 "Dewey") . }.
+
+  { :Let :param ("Huey" "Dewey" "Louie") . }
+    pe:by [ pe:fact "list-iterate.n3"; pe:line 9 ].
+
+  { ("Huey" "Dewey" "Louie") list:iterate (0 "Huey") . }
+    pe:by [ pe:builtin list:iterate ].
+
+  { ("Huey" "Dewey" "Louie") list:iterate (1 "Dewey") . }
+    pe:by [ pe:builtin list:iterate ].
+}.
+
+{ "Dewey" :hasIndex 1 . } pe:why {
+  { "Dewey" :hasIndex 1 . }
+    pe:by [ pe:rule "list-iterate.n3"; pe:line 11 ];
+    pe:binding
+      [ pe:var "X"; pe:value ("Huey" "Dewey" "Louie") ],
+      [ pe:var "Y"; pe:value (0 "Huey") ],
+      [ pe:var "Z"; pe:value 1 ];
+    pe:uses
+      { :Let :param ("Huey" "Dewey" "Louie") . },
+      { ("Huey" "Dewey" "Louie") list:iterate (0 "Huey") . },
+      { ("Huey" "Dewey" "Louie") list:iterate (1 "Dewey") . },
+      { ("Huey" "Dewey" "Louie") list:iterate (1 "Dewey") . }.
+
+  { :Let :param ("Huey" "Dewey" "Louie") . }
+    pe:by [ pe:fact "list-iterate.n3"; pe:line 9 ].
+
+  { ("Huey" "Dewey" "Louie") list:iterate (0 "Huey") . }
+    pe:by [ pe:builtin list:iterate ].
+
+  { ("Huey" "Dewey" "Louie") list:iterate (1 "Dewey") . }
+    pe:by [ pe:builtin list:iterate ].
+}.
+
+{ ("Huey" "Dewey" "Louie") :iterate (1 "Dewey") . } pe:why {
+  { ("Huey" "Dewey" "Louie") :iterate (1 "Dewey") . }
+    pe:by [ pe:rule "list-iterate.n3"; pe:line 11 ];
+    pe:binding
+      [ pe:var "X"; pe:value ("Huey" "Dewey" "Louie") ],
+      [ pe:var "Y"; pe:value (1 "Dewey") ],
+      [ pe:var "Z"; pe:value 1 ];
+    pe:uses
+      { :Let :param ("Huey" "Dewey" "Louie") . },
+      { ("Huey" "Dewey" "Louie") list:iterate (1 "Dewey") . },
+      { ("Huey" "Dewey" "Louie") list:iterate (1 "Dewey") . },
+      { ("Huey" "Dewey" "Louie") list:iterate (1 "Dewey") . }.
+
+  { :Let :param ("Huey" "Dewey" "Louie") . }
+    pe:by [ pe:fact "list-iterate.n3"; pe:line 9 ].
+
+  { ("Huey" "Dewey" "Louie") list:iterate (1 "Dewey") . }
+    pe:by [ pe:builtin list:iterate ].
+}.
+
+{ ("Huey" "Dewey" "Louie") :iterate (2 "Louie") . } pe:why {
+  { ("Huey" "Dewey" "Louie") :iterate (2 "Louie") . }
+    pe:by [ pe:rule "list-iterate.n3"; pe:line 11 ];
+    pe:binding
+      [ pe:var "X"; pe:value ("Huey" "Dewey" "Louie") ],
+      [ pe:var "Y"; pe:value (2 "Louie") ],
+      [ pe:var "Z"; pe:value 1 ];
+    pe:uses
+      { :Let :param ("Huey" "Dewey" "Louie") . },
+      { ("Huey" "Dewey" "Louie") list:iterate (2 "Louie") . },
+      { ("Huey" "Dewey" "Louie") list:iterate (1 "Dewey") . },
+      { ("Huey" "Dewey" "Louie") list:iterate (1 "Dewey") . }.
+
+  { :Let :param ("Huey" "Dewey" "Louie") . }
+    pe:by [ pe:fact "list-iterate.n3"; pe:line 9 ].
+
+  { ("Huey" "Dewey" "Louie") list:iterate (2 "Louie") . }
+    pe:by [ pe:builtin list:iterate ].
+
+  { ("Huey" "Dewey" "Louie") list:iterate (1 "Dewey") . }
+    pe:by [ pe:builtin list:iterate ].
+}.
+
+{ :test :is true . } pe:why {
+  { :test :is true . }
+    pe:by [ pe:rule "list-iterate.n3"; pe:line 31 ];
+    pe:binding
+      [ pe:var "X"; pe:value ("Huey" "Dewey" "Louie") ],
+      [ pe:var "Y"; pe:value (0 "Huey") ];
+    pe:uses
+      { ("Huey" "Dewey" "Louie") :iterate (0 "Huey") . },
+      { "Dewey" :hasIndex 1 . }.
+
+  { ("Huey" "Dewey" "Louie") :iterate (0 "Huey") . }
+    pe:by [ pe:rule "list-iterate.n3"; pe:line 11 ];
+    pe:binding
+      [ pe:var "X"; pe:value ("Huey" "Dewey" "Louie") ],
+      [ pe:var "Y"; pe:value (0 "Huey") ],
+      [ pe:var "Z"; pe:value 1 ];
+    pe:uses
+      { :Let :param ("Huey" "Dewey" "Louie") . },
+      { ("Huey" "Dewey" "Louie") list:iterate (0 "Huey") . },
+      { ("Huey" "Dewey" "Louie") list:iterate (1 "Dewey") . },
+      { ("Huey" "Dewey" "Louie") list:iterate (1 "Dewey") . }.
+
+  { :Let :param ("Huey" "Dewey" "Louie") . }
+    pe:by [ pe:fact "list-iterate.n3"; pe:line 9 ].
+
+  { ("Huey" "Dewey" "Louie") list:iterate (0 "Huey") . }
+    pe:by [ pe:builtin list:iterate ].
+
+  { ("Huey" "Dewey" "Louie") list:iterate (1 "Dewey") . }
+    pe:by [ pe:builtin list:iterate ].
+
+  { "Dewey" :hasIndex 1 . }
+    pe:by [ pe:rule "list-iterate.n3"; pe:line 11 ];
+    pe:binding
+      [ pe:var "X"; pe:value ("Huey" "Dewey" "Louie") ],
+      [ pe:var "Y"; pe:value (0 "Huey") ],
+      [ pe:var "Z"; pe:value 1 ];
+    pe:uses
+      { :Let :param ("Huey" "Dewey" "Louie") . },
+      { ("Huey" "Dewey" "Louie") list:iterate (0 "Huey") . },
+      { ("Huey" "Dewey" "Louie") list:iterate (1 "Dewey") . },
+      { ("Huey" "Dewey" "Louie") list:iterate (1 "Dewey") . }.
+}.

package/examples/proof/list-map.n3

@@ -0,0 +1,44 @@
+@prefix : <http://example.org/#> .
+@prefix list: <http://www.w3.org/2000/10/swap/list#> .
+@prefix pe: <https://eyereasoner.github.io/pe#> .
+
+:test1 :is true .
+:test2 :is true .
+:test3 :is true .
+:test4 :is true .
+
+{ :test1 :is true . } pe:why {
+  { :test1 :is true . }
+    pe:by [ pe:rule "list-map.n3"; pe:line 14 ];
+    pe:uses { ((:s1 :s2) :p1) list:map (:o1 :o2) . }.
+
+  { ((:s1 :s2) :p1) list:map (:o1 :o2) . }
+    pe:by [ pe:builtin list:map ].
+}.
+
+{ :test2 :is true . } pe:why {
+  { :test2 :is true . }
+    pe:by [ pe:rule "list-map.n3"; pe:line 15 ];
+    pe:uses { ((:s1 :s2 :s3) :p1) list:map (:o1 :o2 :o3 :o4) . }.
+
+  { ((:s1 :s2 :s3) :p1) list:map (:o1 :o2 :o3 :o4) . }
+    pe:by [ pe:builtin list:map ].
+}.
+
+{ :test3 :is true . } pe:why {
+  { :test3 :is true . }
+    pe:by [ pe:rule "list-map.n3"; pe:line 16 ];
+    pe:uses { ((:s4) :p1) list:map () . }.
+
+  { ((:s4) :p1) list:map () . }
+    pe:by [ pe:builtin list:map ].
+}.
+
+{ :test4 :is true . } pe:why {
+  { :test4 :is true . }
+    pe:by [ pe:rule "list-map.n3"; pe:line 17 ];
+    pe:uses { ((:s1) :p2) list:map () . }.
+
+  { ((:s1) :p2) list:map () . }
+    pe:by [ pe:builtin list:map ].
+}.

package/examples/proof/log-conclusion.n3

@@ -0,0 +1,118 @@
+@prefix : <http://example.org/> .
+@prefix log: <http://www.w3.org/2000/10/swap/log#> .
+@prefix pe: <https://eyereasoner.github.io/pe#> .
+@prefix rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#> .
+
+:result :is {
+    :Felix a :Cat .
+    {
+        ?X a :Cat .
+    } => {
+        ?X :says "Meow" .
+    } .
+    :Felix :says "Meow" .
+} .
+
+{
+    :result :is {
+        :Felix a :Cat .
+        {
+            ?X a :Cat .
+        } => {
+            ?X :says "Meow" .
+        } .
+        :Felix :says "Meow" .
+    } .
+} pe:why {
+  {
+    :result :is {
+        :Felix a :Cat .
+        {
+            ?X a :Cat .
+        } => {
+            ?X :says "Meow" .
+        } .
+        :Felix :says "Meow" .
+    } .
+}
+    pe:by [ pe:rule "log-conclusion.n3"; pe:line 13 ];
+    pe:binding
+      [ pe:var "conclusion"; pe:value {
+          :Felix a :Cat .
+          {
+              ?X a :Cat .
+          } => {
+              ?X :says "Meow" .
+          } .
+          :Felix :says "Meow" .
+      } ],
+      [ pe:var "param"; pe:value {
+          :Felix a :Cat .
+          {
+              ?X a :Cat .
+          } => {
+              ?X :says "Meow" .
+          } .
+      } ];
+    pe:uses
+      {
+          :let :param {
+              :Felix a :Cat .
+              {
+                  ?X a :Cat .
+              } => {
+                  ?X :says "Meow" .
+              } .
+          } .
+      },
+      {
+          {
+              :Felix a :Cat .
+              {
+                  ?X a :Cat .
+              } => {
+                  ?X :says "Meow" .
+              } .
+          } log:conclusion {
+              :Felix a :Cat .
+              {
+                  ?X a :Cat .
+              } => {
+                  ?X :says "Meow" .
+              } .
+              :Felix :says "Meow" .
+          } .
+      }.
+
+  {
+    :let :param {
+        :Felix a :Cat .
+        {
+            ?X a :Cat .
+        } => {
+            ?X :says "Meow" .
+        } .
+    } .
+}
+    pe:by [ pe:fact "log-conclusion.n3"; pe:line 8 ].
+
+  {
+    {
+        :Felix a :Cat .
+        {
+            ?X a :Cat .
+        } => {
+            ?X :says "Meow" .
+        } .
+    } log:conclusion {
+        :Felix a :Cat .
+        {
+            ?X a :Cat .
+        } => {
+            ?X :says "Meow" .
+        } .
+        :Felix :says "Meow" .
+    } .
+}
+    pe:by [ pe:builtin log:conclusion ].
+}.

package/examples/proof/log-for-all-in.n3

@@ -0,0 +1,33 @@
+@prefix : <http://example.org/#> .
+@prefix log: <http://www.w3.org/2000/10/swap/log#> .
+@prefix pe: <https://eyereasoner.github.io/pe#> .
+@prefix rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#> .
+
+:result :is true .
+
+{ :result :is true . } pe:why {
+  { :result :is true . }
+    pe:by [ pe:rule "log-for-all-in.n3"; pe:line 14 ];
+    pe:binding [ pe:var "c"; pe:value :c ];
+    pe:uses
+      { :c a :CompositeTask . },
+      {
+          ({
+              :c :subTask ?s .
+          } {
+              ?s :state :Completed .
+          }) log:forAllIn ?_b1 .
+      }.
+
+  { :c a :CompositeTask . }
+    pe:by [ pe:fact "log-for-all-in.n3"; pe:line 8 ].
+
+  {
+    ({
+        :c :subTask ?s .
+    } {
+        ?s :state :Completed .
+    }) log:forAllIn ?_b1 .
+}
+    pe:by [ pe:builtin log:forAllIn ].
+}.

package/examples/proof/log-not-includes.n3

@@ -0,0 +1,55 @@
+@prefix : <http://example.org/#> .
+@prefix log: <http://www.w3.org/2000/10/swap/log#> .
+@prefix math: <http://www.w3.org/2000/10/swap/math#> .
+@prefix pe: <https://eyereasoner.github.io/pe#> .
+
+:x :y 1 .
+{
+    :x :y 1 .
+} => {
+    :a :b :c .
+} .
+:a :b :c .
+
+{ :x :y 1 . } pe:why {
+  { :x :y 1 . }
+    pe:by [ pe:rule "log-not-includes.n3"; pe:line 10 ];
+    pe:uses { 1 math:equalTo 1 . }.
+
+  { 1 math:equalTo 1 . }
+    pe:by [ pe:builtin math:equalTo ].
+}.
+
+{
+    {
+        :x :y 1 .
+    } => {
+        :a :b :c .
+    } .
+} pe:why {
+  {
+    {
+        :x :y 1 .
+    } => {
+        :a :b :c .
+    } .
+}
+    pe:by [ pe:rule "log-not-includes.n3"; pe:line 10 ];
+    pe:uses { 1 math:equalTo 1 . }.
+
+  { 1 math:equalTo 1 . }
+    pe:by [ pe:builtin math:equalTo ].
+}.
+
+{ :a :b :c . } pe:why {
+  { :a :b :c . }
+    pe:by [ pe:rule "log-not-includes.n3"; pe:line 10 ];
+    pe:uses { :x :y 1 . }.
+
+  { :x :y 1 . }
+    pe:by [ pe:rule "log-not-includes.n3"; pe:line 10 ];
+    pe:uses { 1 math:equalTo 1 . }.
+
+  { 1 math:equalTo 1 . }
+    pe:by [ pe:builtin math:equalTo ].
+}.

package/examples/proof/log-uri.n3

@@ -0,0 +1,34 @@
+@prefix : <http://example.org/#> .
+@prefix log: <http://www.w3.org/2000/10/swap/log#> .
+@prefix pe: <https://eyereasoner.github.io/pe#> .
+
+:uriString :is "https://www.w3.org" .
+:uriResource :is <https://www.w3.org> .
+
+{ :uriString :is "https://www.w3.org" . } pe:why {
+  { :uriString :is "https://www.w3.org" . }
+    pe:by [ pe:rule "log-uri.n3"; pe:line 8 ];
+    pe:binding
+      [ pe:var "r"; pe:value <https://www.w3.org> ],
+      [ pe:var "s"; pe:value "https://www.w3.org" ];
+    pe:uses
+      { <https://www.w3.org> log:uri "https://www.w3.org" . },
+      { <https://www.w3.org> log:uri "https://www.w3.org" . }.
+
+  { <https://www.w3.org> log:uri "https://www.w3.org" . }
+    pe:by [ pe:builtin log:uri ].
+}.
+
+{ :uriResource :is <https://www.w3.org> . } pe:why {
+  { :uriResource :is <https://www.w3.org> . }
+    pe:by [ pe:rule "log-uri.n3"; pe:line 8 ];
+    pe:binding
+      [ pe:var "r"; pe:value <https://www.w3.org> ],
+      [ pe:var "s"; pe:value "https://www.w3.org" ];
+    pe:uses
+      { <https://www.w3.org> log:uri "https://www.w3.org" . },
+      { <https://www.w3.org> log:uri "https://www.w3.org" . }.
+
+  { <https://www.w3.org> log:uri "https://www.w3.org" . }
+    pe:by [ pe:builtin log:uri ].
+}.

package/examples/proof/rule-matching.n3

@@ -0,0 +1,34 @@
+@prefix : <https://eyereasoner.github.io/ns#> .
+@prefix log: <http://www.w3.org/2000/10/swap/log#> .
+@prefix pe: <https://eyereasoner.github.io/pe#> .
+
+:result :is true .
+
+{ :result :is true . } pe:why {
+  { :result :is true . }
+    pe:by [ pe:rule "rule-matching.n3"; pe:line 8 ];
+    pe:binding
+      [ pe:var "A"; pe:value {
+          ?A__0 => ?B__1 .
+      } ],
+      [ pe:var "B"; pe:value {
+          :result :is true .
+      } ];
+    pe:uses
+      {
+          {
+              ?A__0 => ?B__1 .
+          } => {
+              :result :is true .
+          } .
+      }.
+
+  {
+    {
+        ?A__0 => ?B__1 .
+    } => {
+        :result :is true .
+    } .
+}
+    pe:by [ pe:builtin log:implies ].
+}.

package/examples/rdf-message-window-repair.n3

@@ -0,0 +1,163 @@
+# =========================
+# RDF Message Window Repair
+# =========================
+#
+# Run as:
+#
+#   eyeling -r examples/rdf-message-window-repair.n3 examples/input/rdf-message-window-repair.trig
+#
+# This example is inspired by incremental, inconsistency-resilient reasoning over
+# sliding ABox streams.  The input is a true RDF Message Log: each MESSAGE
+# boundary is parsed by Eyeling into an eymsg: envelope with one payload graph per
+# non-empty message.
+#
+# The rules below keep the message boundaries visible, select two overlapping
+# three-message windows, detect that the current window says the same fire door
+# is both open and closed, and repair the inconsistency by keeping the
+# higher-priority safety-controller assertion for the final materialization.
+
+@prefix : <https://eyereasoner.github.io/eyeling/examples/rdf-message-window-repair#>.
+@prefix eymsg: <https://eyereasoner.github.io/eyeling/vocab/message#>.
+@prefix math: <http://www.w3.org/2000/10/swap/math#>.
+@prefix list: <http://www.w3.org/2000/10/swap/list#>.
+@prefix log: <http://www.w3.org/2000/10/swap/log#>.
+@prefix string: <http://www.w3.org/2000/10/swap/string#>.
+
+# Eyeling's parser-level replay gives a static view of the message log: an
+# ordered list, explicit offsets, and next-envelope links.
+{
+  ?Stream a eymsg:RDFMessageStream;
+    eymsg:envelope ?Message.
+  ?Message a eymsg:MessageEnvelope;
+    eymsg:offset ?Offset.
+} => {
+  ?Message :boundaryExplicit true.
+  ?Message :offset ?Offset.
+}.
+
+# The first payload carries stream policy, like a fixed TBox/configuration that
+# is not itself part of the changing ABox window.
+{
+  ?Message eymsg:payloadGraph ?Payload.
+  ?Payload log:nameOf ?PayloadContext.
+  ?PayloadContext log:includes {
+    :doorA :windowSize ?WindowSize;
+      :repairPolicy :preferHigherPriority.
+    :open :actionText ?OpenAction;
+      :stateText ?OpenStateText.
+    :closed :actionText ?ClosedAction;
+      :stateText ?ClosedStateText.
+  }.
+} => {
+  :doorA :windowSize ?WindowSize;
+    :repairPolicy :preferHigherPriority.
+  :open :actionText ?OpenAction;
+    :stateText ?OpenStateText.
+  :closed :actionText ?ClosedAction;
+    :stateText ?ClosedStateText.
+}.
+
+# With five messages, message 1 is configuration and messages 2-5 are ABox
+# assertions.  The previous and current sliding windows overlap on messages 3
+# and 4; message 2 expires and message 5 enters.
+{
+  ?Stream a eymsg:RDFMessageStream;
+    eymsg:firstEnvelope ?M1.
+  ?M1 eymsg:nextEnvelope ?M2.
+  ?M2 eymsg:nextEnvelope ?M3.
+  ?M3 eymsg:nextEnvelope ?M4.
+  ?M4 eymsg:nextEnvelope ?M5.
+} => {
+  :previousWindow :contains ?M2, ?M3, ?M4.
+  :currentWindow :contains ?M3, ?M4, ?M5.
+  :windowSlide :expired ?M2;
+    :retained ?M3, ?M4;
+    :entered ?M5.
+}.
+
+# Inspect each message payload inside its own replayed RDF Message graph, then
+# lift only the ABox assertion metadata needed for window reasoning.
+{
+  ?Window :contains ?Message.
+  ?Message eymsg:payloadGraph ?Payload.
+  ?Payload log:nameOf ?PayloadContext.
+  ?PayloadContext log:includes {
+    ?Reading :about :doorA;
+      :doorState ?State;
+      :priority ?Priority;
+      :source ?Source.
+  }.
+} => {
+  ?Message :windowAssertion ?Reading;
+    :doorState ?State;
+    :priority ?Priority;
+    :source ?Source.
+  ?Window :hasDoorState ?State.
+}.
+
+# The current graph-level window is inconsistent: after raw materialization it
+# says the same door is both open and closed.
+{
+  :currentWindow :contains ?OpenMessage, ?ClosedMessage.
+  ?OpenMessage :doorState :open.
+  ?ClosedMessage :doorState :closed.
+} => {
+  :currentWindow :rawConflict :doorOpenAndClosed;
+    :inconsistentDoor :doorA.
+}.
+
+# Preferred repair: if a current-window assertion has higher priority than a
+# conflicting current-window assertion, keep the higher-priority assertion as the
+# one used by materialization.
+{
+  :currentWindow :contains ?PreferredMessage, ?RejectedMessage;
+    :rawConflict :doorOpenAndClosed.
+  ?PreferredMessage :doorState ?PreferredState;
+    :priority ?PreferredPriority;
+    :source ?PreferredSource.
+  ?RejectedMessage :doorState ?RejectedState;
+    :priority ?RejectedPriority.
+  ?PreferredState log:notEqualTo ?RejectedState.
+  ?PreferredPriority math:greaterThan ?RejectedPriority.
+} => {
+  :currentWindow :preferredRepairState ?PreferredState;
+    :preferredEvidence ?PreferredMessage;
+    :preferredSource ?PreferredSource;
+    :rejectsLowerPriority ?RejectedMessage;
+    :repairsInconsistency :doorOpenAndClosed;
+    :resolvedDoorState ?PreferredState.
+}.
+
+# Materialize the final operational conclusion from the repaired state rather
+# than from the inconsistent raw window.
+{
+  :currentWindow :preferredRepairState ?State.
+  ?State :actionText ?ActionText.
+} => {
+  :currentWindow :materializedActionText ?ActionText.
+}.
+
+# Emit a report only when the parser replay, sliding-window bookkeeping, raw
+# conflict, preferred repair, and final materialization were all derived.
+{
+  ?Stream a eymsg:RDFMessageStream;
+    eymsg:orderedEnvelopes ?Messages.
+  ?Messages list:length ?Count.
+  :doorA :windowSize ?WindowSize.
+  :previousWindow :contains ?PreviousOnly.
+  :windowSlide :expired ?PreviousOnly;
+    :retained ?Overlap1, ?Overlap2;
+    :entered ?Entered.
+  :currentWindow :rawConflict :doorOpenAndClosed;
+    :inconsistentDoor :doorA;
+    :preferredEvidence ?PreferredMessage;
+    :preferredSource ?PreferredSource;
+    :resolvedDoorState ?State;
+    :materializedActionText ?ActionText.
+  ?State :stateText ?StateText.
+  ?PreferredMessage :priority ?PreferredPriority.
+  ("# rdf-message-window-repair\n\n## Source files\n\n- [N3 rules](../rdf-message-window-repair.n3)\n- [Input RDF Message Log](../input/rdf-message-window-repair.trig)\n- [Story deck](../deck/rdf-message-window-repair.md)\n\n## Answer\nSliding-window RDF Message repair accepted: %d parser-replayed messages produced two overlapping %d-message ABox windows. The current window retained two envelopes from the previous window, expired one old door reading, and added one new safety-controller reading. Its raw graph-level materialization was inconsistent because doorA was both open and closed. The preferred repair kept the priority-%d assertion from %s, resolved the door state to %s, and materialized the action: %s.\n\n## Explanation\nThe RDF Message Log uses VERSION \\\"1.2-messages\\\" and MESSAGE delimiters. Eyeling parses those boundaries into eymsg: envelopes and payload graphs; the rules inspect each payload with log:includes rather than merging message bodies by hand. The example mirrors a sliding-window stream-reasoning pattern: when the window advances, overlapping message evidence is retained, an expired assertion leaves the window, an entering assertion can change the materialization, and a preferred repair fixes a noisy open/closed contradiction before the final action is produced." ?Count ?WindowSize ?PreferredPriority ?PreferredSource ?StateText ?ActionText) string:format ?Block.
+} => {
+  :rdfMessageWindowRepairExample log:outputString ?Block.
+  :rdfMessageWindowRepairExample :demonstrates :RDFMessageLogReplay, :SlidingWindow, :OverlappingWindows, :ABoxStream, :RawDoorInconsistency, :PreferredRepair, :IncrementalMaterialization.
+}.

package/eyeling.js

@@ -6212,16 +6212,16 @@ function __computeConclusionFromFormula(formula) {
   for (const tr of formula.triples) {
     // Treat {A} => {B} as a forward rule.
     if (isLogImplies(tr.p)) {
-      fw.push(__makeRuleFromTerms(tr.s, tr.o, true));
+      fw.push(__copyProofSource(tr, __makeRuleFromTerms(tr.s, tr.o, true)));
       continue;
     }
 
     // Treat {A} <= {B} as the same rule in the other direction, i.e., {B} => {A},
     // so it participates in deductive closure even if only <= is used.
     if (isLogImpliedBy(tr.p)) {
-      fw.push(__makeRuleFromTerms(tr.o, tr.s, true));
+      fw.push(__copyProofSource(tr, __makeRuleFromTerms(tr.o, tr.s, true)));
       // Also index it as a backward rule for completeness (helps proveGoals in some cases).
-      bw.push(__makeRuleFromTerms(tr.s, tr.o, false));
+      bw.push(__copyProofSource(tr, __makeRuleFromTerms(tr.s, tr.o, false)));
       continue;
     }
   }
@@ -8735,7 +8735,7 @@ function forwardChain(facts, forwardRules, backRules, onDerived /* optional */,
           // Promote rule-producing triples to live rules, treating literal true as {}
           // and literal false as a fuse head.
           if (isFwRuleTriple) {
-            const newRule = __makeRuleFromTerms(subj, obj, true);
+            const newRule = __copyProofSource(r, __makeRuleFromTerms(subj, obj, true));
             __prepareForwardRule(newRule);
 
             const key = __ruleKey(
@@ -8752,7 +8752,7 @@ function forwardChain(facts, forwardRules, backRules, onDerived /* optional */,
               rulesChanged = true;
             }
           } else if (isBwRuleTriple) {
-            const newRule = __makeRuleFromTerms(subj, obj, false);
+            const newRule = __copyProofSource(r, __makeRuleFromTerms(subj, obj, false));
 
             const key = __ruleKey(
               newRule.isForward,