eyeling 1.24.25 → 1.24.27

package/examples/rdf-message-flow.n3

@@ -1,14 +1,35 @@
 # ================
 # RDF Message Flow
 # ================
-# A companion to rdf_messages.n3. This example focuses on a live stream where
-# RDF Messages continuously flow through a small processing pipeline. The next
-# message is released only after the current message reaches the sink, so the
-# stream behaves as an ordered, replayable flow rather than a single merged RDF
-# graph.
+#
+# Run as:
+#
+#   eyeling -r examples/rdf-message-flow.n3 examples/input/rdf-message-flow.trig
+#
+# Motivation
+# ----------
+# The RDF Messages draft describes an RDF Message as an RDF dataset interpreted
+# atomically, and an RDF Message Stream as an ordered sequence of such messages.
+# It also defines RDF Message Logs with explicit MESSAGE delimiters. This Eyeling
+# example keeps the same message-level discipline while staying in ordinary
+# N3/TriG that Eyeling can reason over today.
+#
+# The companion TriG file therefore separates two layers:
+#
+#   1. example-local envelope facts in the default graph, such as order,
+#      processing stage, and payload graph; and
+#   2. one named graph per non-empty message payload, treated here as the RDF
+#      dataset/message that must be inspected atomically.
+#
+# The rules below deliberately do not merge all payload graphs into one global
+# graph. Instead, each observation is checked with log:includes inside the named
+# payload formula. The empty heartbeat has no payload graph but still advances
+# through the same pipeline. The next message is released only after the current
+# one reaches the sink, making the example a small back-pressure / flow-control
+# story rather than a batch merge of all input triples.
 
 @prefix : <https://eyereasoner.github.io/eyeling/examples/rdf-message-flow#>.
-@prefix msg: <https://example.org/msg#>.
+@prefix flow: <https://eyereasoner.github.io/eyeling/examples/rdf-message-flow/vocab#>.
 @prefix prov: <http://www.w3.org/ns/prov#>.
 @prefix sosa: <http://www.w3.org/ns/sosa/>.
 @prefix xsd: <http://www.w3.org/2001/XMLSchema#>.
@@ -17,126 +38,120 @@
 @prefix log: <http://www.w3.org/2000/10/swap/log#>.
 @prefix string: <http://www.w3.org/2000/10/swap/string#>.
 
-
-# The stream starts with just the first message at ingress. Later messages are
-# not pre-loaded; each one is released by the previous message after sink.
-
-
-
-# Empty heartbeat: it flows through the same pipeline and keeps the stream live.
-
-
-
-# Stage 1: once a message has entered the stream, validate its envelope.
-
-{ ?Message :atStage :ingest. } => {
-  ?Message :atStage :validate.
+# Stage 1: once an envelope has entered the stream, validate it.
+{ ?Envelope :atStage :ingest. } => {
+  ?Envelope :atStage :validate.
 }.
 
-# Stage 2: validation preserves the message boundary before interpretation.
+# Stage 2: validation records that the envelope keeps an explicit message
+# boundary before the payload is interpreted.
 {
-  ?Message :atStage :validate;
-    a msg:RDFMessage;
-    msg:offset ?Offset.
+  ?Envelope :atStage :validate;
+    a flow:MessageEnvelope;
+    flow:offset ?Offset.
 } => {
-  ?Message msg:boundaryExplicit true.
-  ?Message :atStage :interpret.
+  ?Envelope flow:boundaryExplicit true.
+  ?Envelope :atStage :interpret.
 }.
 
-# Stage 3a: observation payloads are inspected inside their message formula.
+# Stage 3a: observation payloads are inspected inside their own payload graph.
+# This models the RDF Messages idea that messages are separate atomic datasets.
 {
-  ?Message :atStage :interpret;
-    msg:payloadKind :observation;
-    msg:expectedResult ?Result;
-    msg:payload ?Payload.
+  ?Envelope :atStage :interpret;
+    flow:payloadKind :observation;
+    flow:expectedResult ?Result;
+    flow:payloadGraph ?Payload.
   ?Payload log:nameOf ?PayloadContext.
   ?PayloadContext log:includes { ?Observation sosa:hasSimpleResult ?Result. }.
 } => {
-  ?Message msg:payloadResult ?Result.
-  ?Message :atStage :route.
+  ?Envelope flow:payloadResult ?Result.
+  ?Envelope :atStage :route.
 }.
 
-# Stage 3b: empty heartbeats have no payload, but still move through the flow.
+# Stage 3b: empty heartbeats contain no quads, but RDF Messages explicitly allow
+# empty messages, so the envelope still moves through the flow.
 {
-  ?Message :atStage :interpret;
-    msg:payloadKind :heartbeat.
+  ?Envelope :atStage :interpret;
+    flow:payloadKind :heartbeat.
 } => {
-  ?Message msg:emptyMessageAllowed true.
-  ?Message :atStage :route.
+  ?Envelope flow:emptyMessageAllowed true.
+  ?Envelope :atStage :route.
 }.
 
 # Stage 4a: hot observations are routed to the alert sink.
 {
-  ?Message :atStage :route;
-    msg:payloadResult ?Result.
+  ?Envelope :atStage :route;
+    flow:payloadResult ?Result.
   :temperatureFlow :highThreshold ?Threshold.
   ?Result math:greaterThan ?Threshold.
 } => {
-  ?Message :route :alertSink.
-  ?Message :atStage :sink.
-  :alertSink :received ?Message.
+  ?Envelope :route :alertSink.
+  ?Envelope :atStage :sink.
+  :alertSink :received ?Envelope.
 }.
 
 # Stage 4b: normal observations are routed to the archive sink.
 {
-  ?Message :atStage :route;
-    msg:payloadResult ?Result.
+  ?Envelope :atStage :route;
+    flow:payloadResult ?Result.
   :temperatureFlow :highThreshold ?Threshold.
   ?Result math:notGreaterThan ?Threshold.
 } => {
-  ?Message :route :archiveSink.
-  ?Message :atStage :sink.
-  :archiveSink :received ?Message.
+  ?Envelope :route :archiveSink.
+  ?Envelope :atStage :sink.
+  :archiveSink :received ?Envelope.
 }.
 
 # Stage 4c: heartbeats are routed separately from observations.
 {
-  ?Message :atStage :route;
-    msg:emptyMessageAllowed true.
+  ?Envelope :atStage :route;
+    flow:emptyMessageAllowed true.
 } => {
-  ?Message :route :heartbeatSink.
-  ?Message :atStage :sink.
-  :heartbeatSink :received ?Message.
+  ?Envelope :route :heartbeatSink.
+  ?Envelope :atStage :sink.
+  :heartbeatSink :received ?Envelope.
 }.
 
-# Continuous-flow rule: reaching the sink releases the next message into ingress.
+# Continuous-flow rule: reaching the sink releases the next envelope into ingress.
+# This mirrors a consumer-visible ordered stream: later messages are not processed
+# until the earlier message has completed the pipeline.
 {
-  ?Message :atStage :sink;
-    msg:nextMessage ?Next.
-  ?Next a msg:RDFMessage.
+  ?Envelope :atStage :sink;
+    flow:nextEnvelope ?Next.
+  ?Next a flow:MessageEnvelope.
 } => {
-  ?Message :releases ?Next.
+  ?Envelope :releases ?Next.
   ?Next :atStage :ingest.
 }.
 
-# The Eyeling verdict is emitted only after all five messages have flowed through
-# ingest, validation, interpretation, routing, and sink.
+# The Eyeling verdict is emitted only after all five envelopes have flowed
+# through ingest, validation, interpretation, routing, and sink while preserving
+# their message boundaries.
 {
-  :temperatureFlow msg:orderedMessages ?Messages;
+  :temperatureFlow flow:orderedEnvelopes ?Envelopes;
     :highThreshold ?Threshold.
-  ?Messages list:length ?Count.
+  ?Envelopes list:length ?Count.
   :m001 :atStage :sink;
-    msg:payloadResult ?FirstResult;
+    flow:payloadResult ?FirstResult;
     :route :archiveSink;
     :releases :m002.
   :m002 :atStage :sink;
-    msg:payloadResult ?SecondResult;
+    flow:payloadResult ?SecondResult;
     :route :archiveSink;
     :releases :m003.
   :m003 :atStage :sink;
-    msg:emptyMessageAllowed true;
+    flow:emptyMessageAllowed true;
     :route :heartbeatSink;
     :releases :m004.
   :m004 :atStage :sink;
-    msg:payloadResult ?FourthResult;
+    flow:payloadResult ?FourthResult;
     :route :alertSink;
     :releases :m005.
   :m005 :atStage :sink;
-    msg:payloadResult ?FifthResult;
+    flow:payloadResult ?FifthResult;
     :route :alertSink.
-  ("# rdf-message-flow\n\n## Source files\n\n- [N3 rules](../rdf-message-flow.n3)\n- [Input TriG](../input/rdf-message-flow.trig)\n\n## Answer\nContinuous RDF Message flow accepted: %d ordered messages moved through the ingest → validate → interpret → route → sink pipeline. The threshold was %d, so results %s and %s were archived, the heartbeat kept the stream alive, and results %s and %s were emitted as alerts.\n\n## Explanation\nThe N3 source starts only :m001 at ingress. Each message must reach :sink before the continuous-flow rule releases its msg:nextMessage. Observation payloads are inspected with log:includes inside each message formula, while the empty heartbeat uses the same envelope and routing stages without a payload. This models messages flowing through a live stream while preserving message boundaries." ?Count ?Threshold ?FirstResult ?SecondResult ?FourthResult ?FifthResult) string:format ?Block.
+  ("# rdf-message-flow\n\n## Source files\n\n- [N3 rules](../rdf-message-flow.n3)\n- [Input TriG](../input/rdf-message-flow.trig)\n\n## Answer\nContinuous RDF Message flow accepted: %d ordered message envelopes moved through the ingest → validate → interpret → route → sink pipeline. The threshold was %d, so results %s and %s were archived, the heartbeat kept the stream alive, and results %s and %s were emitted as alerts.\n\n## Explanation\nThe input is a single runnable example split across an N3 rule file and a TriG sidecar. The TriG file uses example-local envelope facts for stream order and processing state, while each named payload graph is treated as an atomic RDF Message dataset. Only :m001 starts at ingress; each envelope must reach :sink before the continuous-flow rule releases its flow:nextEnvelope. Observation payloads are inspected with log:includes inside their own payload formula, and the empty heartbeat advances without a payload graph. This keeps message boundaries visible to the reasoner instead of merging all payload triples into one global graph." ?Count ?Threshold ?FirstResult ?SecondResult ?FourthResult ?FifthResult) string:format ?Block.
 } => {
   :rdfMessageFlowExample log:outputString ?Block.
   :rdfMessageFlowExample :demonstrates :ContinuousFlow, :BackPressureRelease, :AtomicMessageContext, :HeartbeatInFlow, :ThresholdRouting.
 }.
-

package/examples/rdf-message-microgrid.n3

@@ -0,0 +1,141 @@
+# =====================
+# RDF Message Microgrid
+# =====================
+#
+# Run as:
+#
+#   eyeling -r examples/rdf-message-microgrid.n3 examples/input/rdf-message-microgrid.trig
+#
+# Motivation
+# ----------
+# A clinic has lost grid power during a storm. Several small systems continue to
+# send RDF data: one message describes life-safety loads, another describes the
+# current battery and solar situation, another describes flexible demand that may
+# be deferred, and a fourth message is an empty heartbeat.
+#
+# The RDF Messages draft treats each message as an RDF dataset intended to be
+# interpreted atomically. It also treats a message stream as an ordered sequence
+# and allows empty messages. This example models those ideas in ordinary TriG/N3:
+# the companion TriG file contains application-local envelope facts in the
+# default graph, and each non-empty payload is placed in its own named graph.
+#
+# The point is not only technical. Atomic messages let a small reasoner make a
+# careful decision under pressure: protect the oxygen concentrator and vaccine
+# fridge, defer the EV chargers, and explain the action from the replayed message
+# boundaries instead of silently merging every payload into one timeless graph.
+#
+# This is intentionally not a parser-level VERSION "1.2-messages" / MESSAGE
+# delimiter test. It is a reasoning example over an already-materialized sidecar
+# representation of a message log.
+
+@prefix : <https://eyereasoner.github.io/eyeling/examples/rdf-message-microgrid#>.
+@prefix rmsg: <https://eyereasoner.github.io/eyeling/examples/rdf-message-microgrid/vocab#>.
+@prefix prov: <http://www.w3.org/ns/prov#>.
+@prefix xsd: <http://www.w3.org/2001/XMLSchema#>.
+@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#>.
+
+# Every envelope with an offset is an explicit replay boundary. The envelope is
+# application-local metadata; the payload graph is the dataset/message being
+# interpreted atomically.
+{
+  ?Log a rmsg:MessageLog;
+    rmsg:message ?Message.
+  ?Message a rmsg:MessageEnvelope;
+    rmsg:offset ?Offset.
+} => {
+  ?Message rmsg:boundaryExplicit true.
+  ?Log rmsg:replayContains ?Message.
+}.
+
+# Empty RDF Messages are valid. Here the fourth envelope is a heartbeat that
+# confirms the stream is still alive without adding any payload triples.
+{
+  ?Message a rmsg:MessageEnvelope;
+    rmsg:payloadKind :heartbeat.
+} => {
+  ?Message rmsg:emptyMessageAllowed true.
+}.
+
+# Inspect the life-safety message inside its own payload graph.
+{
+  ?Message rmsg:payloadKind :lifeSafetyLoads;
+    rmsg:payloadGraph ?Payload.
+  ?Payload log:nameOf ?PayloadContext.
+  ?PayloadContext log:includes {
+    :oxygenConcentrator :requiresWatts ?Oxygen.
+    :vaccineFridge :requiresWatts ?Fridge.
+  }.
+  (?Oxygen ?Fridge) math:sum ?CriticalWatts.
+} => {
+  :clinicMicrogrid rmsg:criticalWatts ?CriticalWatts.
+  :clinicMicrogrid rmsg:mustKeep :oxygenConcentrator, :vaccineFridge.
+}.
+
+# Inspect the power-status message atomically.
+{
+  ?Message rmsg:payloadKind :powerStatus;
+    rmsg:payloadGraph ?Payload.
+  ?Payload log:nameOf ?PayloadContext.
+  ?PayloadContext log:includes {
+    :batteryBank :availableWatts ?BatteryWatts.
+    :solarForecast :expectedWatts ?SolarWatts.
+  }.
+  (?BatteryWatts ?SolarWatts) math:sum ?AvailableWatts.
+} => {
+  :clinicMicrogrid rmsg:availableWatts ?AvailableWatts.
+}.
+
+# Inspect the flexible-demand message atomically. The EV chargers are useful, but
+# they are safe to defer so life-safety loads keep running.
+{
+  ?Message rmsg:payloadKind :flexibleDemand;
+    rmsg:payloadGraph ?Payload.
+  ?Payload log:nameOf ?PayloadContext.
+  ?PayloadContext log:includes {
+    :evChargers :shedWatts ?ShedWatts.
+  }.
+} => {
+  :clinicMicrogrid rmsg:deferrableWatts ?ShedWatts.
+  :clinicMicrogrid rmsg:mayDefer :evChargers.
+}.
+
+# The decision combines conclusions from the separate messages, while preserving
+# the evidence that each conclusion came through an explicit message boundary.
+{
+  :clinicMicrogrid rmsg:criticalWatts ?CriticalWatts;
+    rmsg:availableWatts ?AvailableWatts;
+    rmsg:deferrableWatts ?ShedWatts;
+    rmsg:mustKeep :oxygenConcentrator, :vaccineFridge;
+    rmsg:mayDefer :evChargers.
+  (?AvailableWatts ?ShedWatts) math:sum ?ProtectedBudget.
+  ?ProtectedBudget math:greaterThan ?CriticalWatts.
+} => {
+  :clinicMicrogrid rmsg:protectedBudgetWatts ?ProtectedBudget.
+  :clinicMicrogrid rmsg:resilienceAction :protectClinic.
+  :clinicMicrogrid rmsg:keeps :oxygenConcentrator, :vaccineFridge.
+  :clinicMicrogrid rmsg:defers :evChargers.
+}.
+
+# Emit the example report only when the message stream, empty heartbeat, atomic
+# payload inspection, and protection decision have all been derived.
+{
+  :stormClinicLog rmsg:orderedMessages ?Messages.
+  ?Messages list:length ?Count.
+  :m001 rmsg:boundaryExplicit true.
+  :m002 rmsg:boundaryExplicit true.
+  :m003 rmsg:boundaryExplicit true.
+  :m004 rmsg:boundaryExplicit true;
+    rmsg:emptyMessageAllowed true.
+  :clinicMicrogrid rmsg:criticalWatts ?CriticalWatts;
+    rmsg:availableWatts ?AvailableWatts;
+    rmsg:deferrableWatts ?ShedWatts;
+    rmsg:protectedBudgetWatts ?ProtectedBudget;
+    rmsg:resilienceAction :protectClinic.
+  ("# rdf-message-microgrid\n\n## Source files\n\n- [N3 rules](../rdf-message-microgrid.n3)\n- [Input TriG](../input/rdf-message-microgrid.trig)\n\n## Answer\nStorm clinic microgrid accepted: %d RDF Message envelopes were replayed atomically. Critical care needs %d W, current battery plus solar gives %d W, and deferring the EV chargers frees %d W, so the protected budget is %d W. The reasoned action is to keep the oxygen concentrator and vaccine fridge online, while deferring EV charging.\n\n## Why this is an RDF Messages example\nThe input is a single runnable example split across an N3 rule file and a TriG sidecar. The default graph records stream order, offsets, and envelope metadata. Each non-empty named graph is treated as an atomic message payload, and the fourth message is an empty heartbeat. The rules inspect each payload with log:includes inside its own formula, then combine only the derived conclusions needed for the microgrid decision. This keeps the explanation tied to message boundaries instead of silently flattening the stream into one global graph.\n\nThis is intentionally not a parser-level VERSION \\\"1.2-messages\\\" / MESSAGE delimiter test. It is a reasoning example over an already-materialized sidecar representation of a message log." ?Count ?CriticalWatts ?AvailableWatts ?ShedWatts ?ProtectedBudget) string:format ?Block.
+} => {
+  :rdfMessageMicrogridExample log:outputString ?Block.
+  :rdfMessageMicrogridExample :demonstrates :AtomicMessageContext, :EmptyHeartbeat, :ReplayableMessageLog, :ResilientDecisionSupport.
+}.

package/examples/rdf-messages.n3

@@ -1,16 +1,38 @@
 # ============
 # RDF Messages
 # ============
-# This Eyeling example models the main idea from
-# https://pietercolpaert.be/papers/eswc2026-rdf-messages/:
-# a message stream/log is not just one freely mergeable RDF graph. It is an
-# ordered sequence of RDF Datasets that are interpreted atomically, one message
-# at a time. The middle message is deliberately empty to model a heartbeat, and
-# the local blank-node label "_:b0" is deliberately reused by two messages to
-# show message-scoped blank nodes.
+#
+# Run as:
+#
+#   eyeling -r examples/rdf-messages.n3 examples/input/rdf-messages.trig
+#
+# Motivation
+# ----------
+# The RDF Messages draft defines an RDF Message as an RDF dataset interpreted
+# atomically, an RDF Message Stream as an ordered sequence of messages, and an
+# RDF Message Log as a replayable record of such a stream. The draft also says
+# that messages should not be combined by default and that blank node labels are
+# scoped to the message in which they occur.
+#
+# This Eyeling example demonstrates those ideas in ordinary N3/TriG rather than
+# in a parser-level RDF Message Log with VERSION "1.2-messages" and MESSAGE
+# delimiters. The companion TriG file therefore has two layers:
+#
+#   1. application-local envelope facts in the default graph, such as message
+#      order, offset, expected result, and the textual blank-node label seen in
+#      the original stream; and
+#   2. one named graph per non-empty message payload, treated as the atomic RDF
+#      dataset/message to be inspected.
+#
+# The rules below validate a replay archive with three message envelopes. The
+# middle message is an empty heartbeat. The first and third messages both record
+# the local blank-node label "_:b0"; because this sidecar is normal TriG, the
+# actual TriG blank nodes are unique, while the envelope records show the
+# message-scoped label reuse that a true RDF Message Log parser would preserve
+# by resetting blank-node scope at each MESSAGE delimiter.
 
 @prefix : <https://eyereasoner.github.io/eyeling/examples/rdf-messages#>.
-@prefix msg: <https://w3c-cg.github.io/rsp/spec/messages#>.
+@prefix rmsg: <https://eyereasoner.github.io/eyeling/examples/rdf-messages/vocab#>.
 @prefix prov: <http://www.w3.org/ns/prov#>.
 @prefix sosa: <http://www.w3.org/ns/sosa/>.
 @prefix xsd: <http://www.w3.org/2001/XMLSchema#>.
@@ -19,51 +41,49 @@
 @prefix log: <http://www.w3.org/2000/10/swap/log#>.
 @prefix string: <http://www.w3.org/2000/10/swap/string#>.
 
-
-
-# Empty RDF Message: a legal heartbeat/keep-alive event.
-
-
 # A message with an offset inside a log has an explicit replay boundary.
-
+# The envelope resource is application-local; the payload graph is the dataset
+# treated as the RDF Message.
 {
-  ?Log a msg:MessageLog;
-    msg:message ?Message.
-  ?Message a msg:RDFMessage;
-    msg:offset ?Offset.
+  ?Log a rmsg:MessageLog;
+    rmsg:message ?Message.
+  ?Message a rmsg:MessageEnvelope;
+    rmsg:offset ?Offset.
 } => {
-  ?Message msg:boundaryExplicit true.
-  ?Log msg:replayContains ?Message.
+  ?Message rmsg:boundaryExplicit true.
+  ?Log rmsg:replayContains ?Message.
 }.
 
-# The payload is a dataset-like formula. We can inspect it without merging it
-# into the global graph, preserving the message as the unit of interpretation.
+# The payload is a dataset-like named graph. Inspect it with log:includes instead
+# of merging all payload triples into the global graph.
 {
-  ?Message a msg:RDFMessage;
-    msg:expectedResult ?Result;
-    msg:payload ?Payload.
+  ?Message a rmsg:MessageEnvelope;
+    rmsg:expectedResult ?Result;
+    rmsg:payloadGraph ?Payload.
   ?Payload log:nameOf ?PayloadContext.
   ?PayloadContext log:includes { ?Observation sosa:hasSimpleResult ?Result. }.
 } => {
-  ?Message msg:payloadResult ?Result.
+  ?Message rmsg:payloadResult ?Result.
 }.
 
-# Heartbeat/keep-alive messages can be empty and still occupy a boundary.
+# Empty messages are legal RDF Messages. Here the empty second envelope acts as
+# a heartbeat/keep-alive and still occupies a boundary in the replay archive.
 {
-  ?Message a msg:RDFMessage;
-    msg:payloadKind :heartbeat.
+  ?Message a rmsg:MessageEnvelope;
+    rmsg:payloadKind :heartbeat.
 } => {
-  ?Message msg:emptyMessageAllowed true.
+  ?Message rmsg:emptyMessageAllowed true.
   :HeartbeatEvidence :accepted ?Message.
 }.
 
-# The same blank-node label may recur in a message log because blank nodes are
-# scoped to their RDF Message, not to the whole replay archive.
+# The same local blank-node label may recur in different messages. In this
+# plain-TriG sidecar the real blank nodes are unique, and the envelope metadata
+# records the per-message label visible in the source stream.
 {
-  ?First a msg:RDFMessage;
-    msg:localBlankLabel ?Label.
-  ?Second a msg:RDFMessage;
-    msg:localBlankLabel ?Label.
+  ?First a rmsg:MessageEnvelope;
+    rmsg:localBlankLabel ?Label.
+  ?Second a rmsg:MessageEnvelope;
+    rmsg:localBlankLabel ?Label.
   ?First log:notEqualTo ?Second.
 } => {
   :BlankNodeScope :reusedLabel ?Label.
@@ -71,35 +91,35 @@
 }.
 
 # Different observations from the same sensor are not a global contradiction:
-# each message is interpreted in its own communication context.
+# by default, message payloads remain separate communication contexts.
 {
-  ?First a msg:RDFMessage;
-    msg:payloadResult ?FirstResult.
-  ?Second a msg:RDFMessage;
-    msg:payloadResult ?SecondResult.
+  ?First a rmsg:MessageEnvelope;
+    rmsg:payloadResult ?FirstResult.
+  ?Second a rmsg:MessageEnvelope;
+    rmsg:payloadResult ?SecondResult.
   ?FirstResult math:notEqualTo ?SecondResult.
   ?First log:notEqualTo ?Second.
 } => {
   :MessageContext :differentObservationsStayContextual true.
 }.
 
-# The Eyeling verdict is emitted only when all message-specific validations have been
-# derived from the log, message metadata, payload formulas, and built-ins.
+# The Eyeling verdict is emitted only when all message-specific validations have
+# been derived from the log metadata, ordered message list, payload graphs, and
+# built-ins.
 {
-  :temperatureLog msg:orderedMessages ?Messages.
+  :temperatureLog rmsg:orderedMessages ?Messages.
   ?Messages list:length ?Count.
-  :m001 msg:boundaryExplicit true;
-    msg:payloadResult ?FirstResult.
-  :m002 msg:boundaryExplicit true;
-    msg:emptyMessageAllowed true.
-  :m003 msg:boundaryExplicit true;
-    msg:payloadResult ?SecondResult.
+  :m001 rmsg:boundaryExplicit true;
+    rmsg:payloadResult ?FirstResult.
+  :m002 rmsg:boundaryExplicit true;
+    rmsg:emptyMessageAllowed true.
+  :m003 rmsg:boundaryExplicit true;
+    rmsg:payloadResult ?SecondResult.
   :BlankNodeScope :reusedLabel ?Label;
     :isPerMessage true.
   :MessageContext :differentObservationsStayContextual true.
-  ("# rdf-messages\n\n## Source files\n\n- [N3 rules](../rdf-messages.n3)\n- [Input TriG](../input/rdf-messages.trig)\n\n## Answer\nRDF Message log accepted: %d explicit message boundaries are preserved. Message :m002 is an empty heartbeat, and the local blank-node label %s is safely reused in separate messages.\n\n## Explanation\nThe N3 source models an RDF Message Log as an ordered sequence of RDF Messages. Each non-empty message has a formula-valued payload that is inspected with log:includes, so the observation data stays inside the message boundary instead of being treated as one global graph. The two temperature results, %s and %s, are different observations from the same stream but are contextualized by their message boundaries." ?Count ?Label ?FirstResult ?SecondResult) string:format ?Block.
+  ("# rdf-messages\n\n## Source files\n\n- [N3 rules](../rdf-messages.n3)\n- [Input TriG](../input/rdf-messages.trig)\n\n## Answer\nRDF Message replay archive accepted: %d explicit message boundaries are preserved. Message :m002 is an empty heartbeat, and the local blank-node label %s is safely reused in separate message envelopes.\n\n## Explanation\nThe input is a single runnable example split across an N3 rule file and a TriG sidecar. The TriG file uses application-local envelope facts for stream order and replay metadata, while each non-empty named payload graph is treated as an atomic RDF Message dataset. Payloads are inspected with log:includes inside their own formulas, so the observation data stays inside the message boundary instead of being treated as one global graph. The two temperature results, %s and %s, are different observations from the same stream but are contextualized by their message boundaries.\n\nThis is intentionally not a parser-level VERSION \\\"1.2-messages\\\" / MESSAGE delimiter test. It is a reasoning example over an already-materialized sidecar representation of a message log." ?Count ?Label ?FirstResult ?SecondResult) string:format ?Block.
 } => {
   :rdfMessagesExample log:outputString ?Block.
   :rdfMessagesExample :demonstrates :ExplicitBoundaries, :AtomicMessageContext, :EmptyHeartbeat, :MessageScopedBlankNodes, :ReplayableMessageLog.
 }.
-

package/eyeling.js

@@ -844,6 +844,62 @@ function compileSwapRegex(pattern, extraFlags) {
   }
 }
 
+function expandSwapRegexReplacement(template, captures) {
+  // SWAP/N3 examples use $1-style capture references, but tests also rely on
+  // Perl-ish escaping in replacement strings: \\$ means a literal dollar sign
+  // and \\ means a literal backslash.  JavaScript's replacement strings do not
+  // interpret those escapes, so expand the replacement explicitly in a callback.
+  let out = '';
+  const text = String(template);
+
+  for (let i = 0; i < text.length; i++) {
+    const ch = text[i];
+
+    if (ch === '\\') {
+      if (i + 1 < text.length && (text[i + 1] === '$' || text[i + 1] === '\\')) {
+        out += text[++i];
+      } else {
+        out += ch;
+      }
+      continue;
+    }
+
+    if (ch === '$') {
+      if (i + 1 < text.length && text[i + 1] === '$') {
+        out += '$';
+        i++;
+        continue;
+      }
+
+      let j = i + 1;
+      while (j < text.length && /[0-9]/.test(text[j])) j++;
+      if (j > i + 1) {
+        const digits = text.slice(i + 1, j);
+        let chosen = null;
+        for (let k = digits.length; k > 0; k--) {
+          const n = Number(digits.slice(0, k));
+          if (n > 0 && n < captures.length) {
+            chosen = { n, len: k };
+            break;
+          }
+        }
+        if (chosen) {
+          out += captures[chosen.n] == null ? '' : String(captures[chosen.n]);
+          out += digits.slice(chosen.len);
+        } else {
+          out += '$' + digits;
+        }
+        i = j - 1;
+        continue;
+      }
+    }
+
+    out += ch;
+  }
+
+  return out;
+}
+
 // -----------------------------------------------------------------------------
 // Strict numeric literal parsing for math: builtins
 // -----------------------------------------------------------------------------
@@ -1699,7 +1755,7 @@ function __pushBuiltinDeltaLimited(out, delta, maxResults) {
 
 function __collectListLikeTermsFromTerm(t, out, seen) {
   if (t instanceof ListTerm || t instanceof OpenListTerm) {
-    const k = termFastKey ? termFastKey(t) : null;
+    const k = termFastKey(t);
     if (k === null || !seen.has(k)) {
       if (k !== null) seen.add(k);
       out.push(t);
@@ -4222,7 +4278,11 @@ function evalBuiltin(goal, subst, facts, backRules, depth, varGen, maxResults) {
     const re = compileSwapRegex(searchStr, 'g');
     if (!re) return [];
 
-    const outStr = dataStr.replace(re, replStr);
+    const outStr = dataStr.replace(re, (...args) => {
+      const captureEnd = args.length - (typeof args.at(-1) === 'object' ? 3 : 2);
+      const captures = args.slice(0, Math.max(1, captureEnd));
+      return expandSwapRegexReplacement(replStr, captures);
+    });
     const lit = makeStringLiteral(outStr);
 
     if (g.o instanceof Var) {
@@ -11498,6 +11558,20 @@ class Parser {
     if (this.peek().typ === 'Ident' && (this.peek().value || '') === 'a') {
       this.next();
       pred = internIri(RDF_NS + 'type');
+    } else if (this.peek().typ === 'Ident' && (this.peek().value || '') === 'has') {
+      // N3 syntactic sugar is also valid in predicate-object lists,
+      // including blank node property lists: [ has :p :o ] means _:b :p :o.
+      this.next();
+      pred = this.parseTerm();
+    } else if (this.peek().typ === 'Ident' && (this.peek().value || '') === 'is') {
+      // N3 syntactic sugar: [ is :p of :s ] means :s :p _:b.
+      this.next();
+      pred = this.parseTerm();
+      if (!(this.peek().typ === 'Ident' && (this.peek().value || '') === 'of')) {
+        this.fail(`Expected 'of' after 'is <expr>', got ${this.peek().toString()}`);
+      }
+      this.next();
+      invert = true;
     } else if (this.peek().typ === 'OpPredInvert') {
       this.next();
       pred = this.parseTerm();