eyeling 1.24.24 → 1.24.26

package/README.md

@@ -3,6 +3,8 @@
 [![npm version](https://img.shields.io/npm/v/eyeling.svg)](https://www.npmjs.com/package/eyeling)
 [![DOI](https://img.shields.io/badge/DOI-10.5281%2Fzenodo.19068086-blue.svg)](https://doi.org/10.5281/zenodo.19068086)
 
+![Eyeling](eyeling.png)
+
 A compact [Notation3 (N3)](https://notation3.org/) reasoner in **JavaScript**.
 
 ## Quick start

package/dist/browser/eyeling.browser.js

@@ -1691,15 +1691,85 @@ function __listElemsForBuiltin(listLike, facts) {
   return null;
 }
 
-function evalListFirstLikeBuiltin(sTerm, oTerm, subst) {
-  if (!(sTerm instanceof ListTerm)) return [];
-  if (!sTerm.elems.length) return [];
-  const first = sTerm.elems[0];
-  const s2 = unifyTerm(oTerm, first, subst);
-  return s2 !== null ? [s2] : [];
+function __pushBuiltinDeltaLimited(out, delta, maxResults) {
+  if (delta === null) return false;
+  out.push(delta);
+  return typeof maxResults === 'number' && maxResults > 0 && out.length >= maxResults;
+}
+
+function __collectListLikeTermsFromTerm(t, out, seen) {
+  if (t instanceof ListTerm || t instanceof OpenListTerm) {
+    const k = termFastKey(t);
+    if (k === null || !seen.has(k)) {
+      if (k !== null) seen.add(k);
+      out.push(t);
+    }
+    if (t instanceof ListTerm) {
+      for (const e of t.elems) __collectListLikeTermsFromTerm(e, out, seen);
+    } else {
+      for (const e of t.prefix) __collectListLikeTermsFromTerm(e, out, seen);
+    }
+    return;
+  }
+  if (t instanceof GraphTerm) {
+    for (const tr of t.triples) {
+      __collectListLikeTermsFromTerm(tr.s, out, seen);
+      __collectListLikeTermsFromTerm(tr.p, out, seen);
+      __collectListLikeTermsFromTerm(tr.o, out, seen);
+    }
+  }
+}
+
+function __collectListLikeTermsFromFacts(facts) {
+  const out = [];
+  const seen = new Set();
+  for (const tr of facts) {
+    __collectListLikeTermsFromTerm(tr.s, out, seen);
+    __collectListLikeTermsFromTerm(tr.o, out, seen);
+  }
+  return out;
+}
+
+function evalListFirstLikeBuiltin(sTerm, oTerm, subst, facts, maxResults) {
+  if (sTerm instanceof ListTerm) {
+    if (!sTerm.elems.length) return [];
+    const first = sTerm.elems[0];
+    const s2 = unifyTerm(oTerm, first, subst);
+    return s2 !== null ? [s2] : [];
+  }
+
+  // For a variable subject, enumerate already-existing collection terms.
+  // This lets a rule body such as `_:x rdf:first 1; rdf:rest rdf:nil`
+  // bind `_:x` to an N3 collection literal `(1)` used elsewhere as a term.
+  // Also include ordinary rdf:first facts so the builtin path does not hide
+  // RDF-serialized lists when the subject starts unbound.
+  if (sTerm instanceof Var) {
+    const out = [];
+
+    for (const listTerm of __collectListLikeTermsFromFacts(facts)) {
+      if (!(listTerm instanceof ListTerm) || !listTerm.elems.length) continue;
+      let s2 = unifyTerm(sTerm, listTerm, subst);
+      if (s2 === null) continue;
+      s2 = unifyTerm(oTerm, listTerm.elems[0], s2);
+      if (__pushBuiltinDeltaLimited(out, s2, maxResults)) return out;
+    }
+
+    const RDF_FIRST = RDF_NS + 'first';
+    for (const tr of facts) {
+      if (!(tr.p instanceof Iri) || tr.p.value !== RDF_FIRST) continue;
+      let s2 = unifyTerm(sTerm, tr.s, subst);
+      if (s2 === null) continue;
+      s2 = unifyTerm(oTerm, tr.o, s2);
+      if (__pushBuiltinDeltaLimited(out, s2, maxResults)) return out;
+    }
+
+    return out;
+  }
+
+  return [];
 }
 
-function evalListRestLikeBuiltin(sTerm, oTerm, subst) {
+function evalListRestLikeBuiltin(sTerm, oTerm, subst, facts, maxResults) {
   // Closed list: (a b c) -> (b c)
   if (sTerm instanceof ListTerm) {
     if (!sTerm.elems.length) return [];
@@ -1720,6 +1790,32 @@ function evalListRestLikeBuiltin(sTerm, oTerm, subst) {
     return s2 !== null ? [s2] : [];
   }
 
+  // See evalListFirstLikeBuiltin(): if the collection subject is still a
+  // variable, enumerate known list literals and ordinary rdf:rest facts.
+  if (sTerm instanceof Var) {
+    const out = [];
+
+    for (const listTerm of __collectListLikeTermsFromFacts(facts)) {
+      if (!(listTerm instanceof ListTerm) || !listTerm.elems.length) continue;
+      let s2 = unifyTerm(sTerm, listTerm, subst);
+      if (s2 === null) continue;
+      const rest = new ListTerm(listTerm.elems.slice(1));
+      s2 = unifyTerm(oTerm, rest, s2);
+      if (__pushBuiltinDeltaLimited(out, s2, maxResults)) return out;
+    }
+
+    const RDF_REST = RDF_NS + 'rest';
+    for (const tr of facts) {
+      if (!(tr.p instanceof Iri) || tr.p.value !== RDF_REST) continue;
+      let s2 = unifyTerm(sTerm, tr.s, subst);
+      if (s2 === null) continue;
+      s2 = unifyTerm(oTerm, tr.o, s2);
+      if (__pushBuiltinDeltaLimited(out, s2, maxResults)) return out;
+    }
+
+    return out;
+  }
+
   return [];
 }
 
@@ -2859,14 +2955,14 @@ function evalBuiltin(goal, subst, facts, backRules, depth, varGen, maxResults) {
     return s2 !== null ? [s2] : [];
   }
   if (pv === RDF_NS + 'first') {
-    return evalListFirstLikeBuiltin(g.s, g.o, subst);
+    return evalListFirstLikeBuiltin(g.s, g.o, subst, facts, maxResults);
   }
 
   // list:rest and rdf:rest
   // true iff $s is a (non-empty) list and $o is the rest (tail) of that list.
   // Schema: $s+ list:rest $o-
   if (pv === LIST_NS + 'rest') {
-    if (g.s instanceof ListTerm || g.s instanceof OpenListTerm) return evalListRestLikeBuiltin(g.s, g.o, subst);
+    if (g.s instanceof ListTerm || g.s instanceof OpenListTerm) return evalListRestLikeBuiltin(g.s, g.o, subst, facts, maxResults);
     const xs = __listElemsForBuiltin(g.s, facts);
     if (!xs || !xs.length) return [];
     const rest = new ListTerm(xs.slice(1));
@@ -2874,7 +2970,7 @@ function evalBuiltin(goal, subst, facts, backRules, depth, varGen, maxResults) {
     return s2 !== null ? [s2] : [];
   }
   if (pv === RDF_NS + 'rest') {
-    return evalListRestLikeBuiltin(g.s, g.o, subst);
+    return evalListRestLikeBuiltin(g.s, g.o, subst, facts, maxResults);
   }
 
   // list:iterate
@@ -7918,7 +8014,10 @@ function proveGoals(goals, subst, facts, backRules, depth, visited, varGen, maxR
     const isRdfFirstOrRest = goalPredicateIri === RDF_NS + 'first' || goalPredicateIri === RDF_NS + 'rest';
     const shouldTreatAsBuiltin =
       isBuiltinPred(goal0.p) &&
-      !(isRdfFirstOrRest && !(goal0.s instanceof ListTerm || goal0.s instanceof OpenListTerm));
+      !(
+        isRdfFirstOrRest &&
+        !(goal0.s instanceof ListTerm || goal0.s instanceof OpenListTerm || goal0.s instanceof Var)
+      );
 
     if (shouldTreatAsBuiltin) {
       const remaining = max - results.length;
@@ -11399,6 +11498,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();
@@ -11703,14 +11816,142 @@ const STRING_NS = 'http://www.w3.org/2000/10/swap/string#';
 const SKOLEM_NS = 'https://eyereasoner.github.io/.well-known/genid/';
 const RDF_JSON_DT = RDF_NS + 'JSON';
 
+function parseUriReferenceForResolution(uri) {
+  // RFC 3986 Appendix B-style component parser, with the scheme tightened to
+  // the RFC scheme grammar. Capturing delimiter presence matters: `?` with an
+  // empty query is defined, while no `?` means undefined.
+  const m = /^(([A-Za-z][A-Za-z0-9+.-]*):)?(\/\/([^/?#]*))?([^?#]*)(\?([^#]*))?(#(.*))?$/u.exec(String(uri));
+  if (!m) return null;
+  return {
+    scheme: m[2] !== undefined ? m[2] : undefined,
+    authority: m[4] !== undefined ? m[4] : undefined,
+    path: m[5] || '',
+    query: m[6] !== undefined ? (m[7] || '') : undefined,
+    fragment: m[8] !== undefined ? (m[9] || '') : undefined,
+  };
+}
+
+function recomposeUriReference(parts) {
+  let out = '';
+  if (parts.scheme !== undefined) out += `${parts.scheme}:`;
+  if (parts.authority !== undefined) out += `//${parts.authority}`;
+  out += parts.path || '';
+  if (parts.query !== undefined) out += `?${parts.query}`;
+  if (parts.fragment !== undefined) out += `#${parts.fragment}`;
+  return out;
+}
+
+function removeLastPathSegment(path) {
+  if (!path) return '';
+  const i = path.lastIndexOf('/');
+  if (i < 0) return '';
+  if (i === 0) return '';
+  return path.slice(0, i);
+}
+
+function removeDotSegments(path) {
+  // RFC 3986 section 5.2.4.  This deliberately avoids WHATWG URL parsing so
+  // Eyeling preserves IRI spelling (for example, it does not add a trailing
+  // slash to `http://example.org`) while still normalizing `.` and `..` path
+  // segments as required by section 5.2.2.
+  let input = String(path || '');
+  let output = '';
+
+  while (input.length > 0) {
+    if (input.startsWith('../')) {
+      input = input.slice(3);
+    } else if (input.startsWith('./')) {
+      input = input.slice(2);
+    } else if (input.startsWith('/./')) {
+      input = `/${input.slice(3)}`;
+    } else if (input === '/.') {
+      input = '/';
+    } else if (input.startsWith('/../')) {
+      input = `/${input.slice(4)}`;
+      output = removeLastPathSegment(output);
+    } else if (input === '/..') {
+      input = '/';
+      output = removeLastPathSegment(output);
+    } else if (input === '.' || input === '..') {
+      input = '';
+    } else {
+      let segmentEnd;
+      if (input[0] === '/') {
+        segmentEnd = input.indexOf('/', 1);
+      } else {
+        segmentEnd = input.indexOf('/');
+      }
+
+      if (segmentEnd < 0) {
+        output += input;
+        input = '';
+      } else {
+        output += input.slice(0, segmentEnd);
+        input = input.slice(segmentEnd);
+      }
+    }
+  }
+
+  return output;
+}
+
+function mergePaths(base, refPath) {
+  if (base.authority !== undefined && base.path === '') {
+    return `/${refPath}`;
+  }
+  const i = base.path.lastIndexOf('/');
+  if (i < 0) return refPath;
+  return `${base.path.slice(0, i + 1)}${refPath}`;
+}
+
 function resolveIriRef(ref, base) {
-  if (!base) return ref;
-  if (/^[A-Za-z][A-Za-z0-9+.-]*:/.test(ref)) return ref; // already absolute
-  try {
-    return new URL(ref, base).toString();
-  } catch {
-    return ref;
+  const r = parseUriReferenceForResolution(ref);
+  if (!r) return ref;
+
+  const baseParts = base ? parseUriReferenceForResolution(base) : null;
+
+  // Absolute references do not need a base, but RFC 3986 section 5.2.2 still
+  // applies remove_dot_segments(R.path) when R.scheme is defined.
+  if (r.scheme !== undefined) {
+    return recomposeUriReference({
+      scheme: r.scheme,
+      authority: r.authority,
+      path: removeDotSegments(r.path),
+      query: r.query,
+      fragment: r.fragment,
+    });
+  }
+
+  // Without a usable base, preserve relative references as written.
+  if (!baseParts || baseParts.scheme === undefined) return ref;
+
+  const t = {
+    scheme: baseParts.scheme,
+    authority: undefined,
+    path: '',
+    query: undefined,
+    fragment: r.fragment,
+  };
+
+  if (r.authority !== undefined) {
+    t.authority = r.authority;
+    t.path = removeDotSegments(r.path);
+    t.query = r.query;
+  } else if (r.path === '') {
+    t.authority = baseParts.authority;
+    t.path = baseParts.path;
+    t.query = r.query !== undefined ? r.query : baseParts.query;
+  } else {
+    t.authority = baseParts.authority;
+    if (r.path.startsWith('/')) {
+      t.path = removeDotSegments(r.path);
+    } else {
+      t.path = removeDotSegments(mergePaths(baseParts, r.path));
+    }
+    t.query = r.query;
   }
+
+  return recomposeUriReference(t);
 }
 
 // -----------------------------------------------------------------------------

package/examples/input/rdf-message-flow.trig

@@ -1,5 +1,29 @@
+# ==============================
+# RDF Message Flow input sidecar
+# ==============================
+#
+# This file is the data half of the runnable example:
+#
+#   eyeling -r examples/rdf-message-flow.n3 examples/input/rdf-message-flow.trig
+#
+# It is intentionally plain TriG rather than a parser-level RDF Message Log with
+# VERSION "1.2-messages" and MESSAGE delimiters. The RDF Messages draft says an
+# RDF Message is an RDF dataset interpreted atomically, that a stream is an
+# ordered sequence of such messages, and that messages in a stream should not be
+# combined by default. To demonstrate those ideas in Eyeling today, the default
+# graph below contains example-local envelope records (:m001 ... :m005) and each
+# non-empty message payload is placed in its own named graph (in:payload001 ...
+# in:payload005).
+#
+# The envelope IRIs are not identifiers for RDF Messages defined by the spec;
+# they are application-level records used by the flow-control rules. The named
+# payload graphs are the datasets/messages being interpreted atomically. The
+# third envelope is an empty heartbeat, which is valid because RDF Messages may
+# be empty. Blank node labels are kept unique because this sidecar is ordinary
+# TriG; a true RDF Message Log parser would reset blank-node scope per MESSAGE.
+
 @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#> .
@@ -10,77 +34,87 @@
 @prefix see: <https://example.org/see#> .
 @prefix in: <https://example.org/see/input#> .
 
-# Formal Eyeling input evidence in RDF 1.2 TriG.
-# The generated runner reads this TriG evidence directly.
-
-:temperatureFlow a msg:MessageStream .
-:temperatureFlow msg:orderedMessages (:m001 :m002 :m003 :m004 :m005) .
-:temperatureFlow msg:message :m001 .
-:temperatureFlow msg:message :m002 .
-:temperatureFlow msg:message :m003 .
-:temperatureFlow msg:message :m004 .
-:temperatureFlow msg:message :m005 .
+:temperatureFlow a flow:RDFMessageStream .
+:temperatureFlow flow:orderedEnvelopes (:m001 :m002 :m003 :m004 :m005) .
+:temperatureFlow flow:envelope :m001 .
+:temperatureFlow flow:envelope :m002 .
+:temperatureFlow flow:envelope :m003 .
+:temperatureFlow flow:envelope :m004 .
+:temperatureFlow flow:envelope :m005 .
+:temperatureFlow :producer :thermometerA .
+:temperatureFlow :consumer :flowProcessor .
 :temperatureFlow :pipeline (:ingest :validate :interpret :route :sink) .
 :temperatureFlow :highThreshold 26 .
+
+:thermometerA a flow:StreamProducer .
+:flowProcessor a flow:StreamConsumer .
+:archiveSink a flow:StreamConsumer .
+:alertSink a flow:StreamConsumer .
+:heartbeatSink a flow:StreamConsumer .
+
+:m001 a flow:MessageEnvelope .
 :m001 :atStage :ingest .
-:m001 a msg:RDFMessage .
-:m001 msg:offset 1 .
-:m001 msg:nextMessage :m002 .
-:m001 prov:generatedAtTime "2026-05-12T18:20:00Z" .
-:m001 msg:payloadKind :observation .
-:m001 msg:expectedResult 21 .
-:m001 msg:payload in:formula1 .
-:m002 a msg:RDFMessage .
-:m002 msg:offset 2 .
-:m002 msg:nextMessage :m003 .
-:m002 prov:generatedAtTime "2026-05-12T18:21:00Z" .
-:m002 msg:payloadKind :observation .
-:m002 msg:expectedResult 22 .
-:m002 msg:payload in:formula2 .
-:m003 a msg:RDFMessage .
-:m003 msg:offset 3 .
-:m003 msg:nextMessage :m004 .
-:m003 prov:generatedAtTime "2026-05-12T18:22:00Z" .
-:m003 msg:payloadKind :heartbeat .
-:m004 a msg:RDFMessage .
-:m004 msg:offset 4 .
-:m004 msg:nextMessage :m005 .
-:m004 prov:generatedAtTime "2026-05-12T18:23:00Z" .
-:m004 msg:payloadKind :observation .
-:m004 msg:expectedResult 28 .
-:m004 msg:payload in:formula3 .
-:m005 a msg:RDFMessage .
-:m005 msg:offset 5 .
-:m005 prov:generatedAtTime "2026-05-12T18:24:00Z" .
-:m005 msg:payloadKind :observation .
-:m005 msg:expectedResult 29 .
-:m005 msg:payload in:formula4 .
+:m001 flow:offset 1 .
+:m001 flow:nextEnvelope :m002 .
+:m001 prov:generatedAtTime "2026-05-12T18:20:00Z"^^xsd:dateTime .
+:m001 flow:payloadKind :observation .
+:m001 flow:expectedResult 21 .
+:m001 flow:payloadGraph in:payload001 .
+
+:m002 a flow:MessageEnvelope .
+:m002 flow:offset 2 .
+:m002 flow:nextEnvelope :m003 .
+:m002 prov:generatedAtTime "2026-05-12T18:21:00Z"^^xsd:dateTime .
+:m002 flow:payloadKind :observation .
+:m002 flow:expectedResult 22 .
+:m002 flow:payloadGraph in:payload002 .
+
+:m003 a flow:MessageEnvelope .
+:m003 flow:offset 3 .
+:m003 flow:nextEnvelope :m004 .
+:m003 prov:generatedAtTime "2026-05-12T18:22:00Z"^^xsd:dateTime .
+:m003 flow:payloadKind :heartbeat .
+
+:m004 a flow:MessageEnvelope .
+:m004 flow:offset 4 .
+:m004 flow:nextEnvelope :m005 .
+:m004 prov:generatedAtTime "2026-05-12T18:23:00Z"^^xsd:dateTime .
+:m004 flow:payloadKind :observation .
+:m004 flow:expectedResult 28 .
+:m004 flow:payloadGraph in:payload004 .
+
+:m005 a flow:MessageEnvelope .
+:m005 flow:offset 5 .
+:m005 prov:generatedAtTime "2026-05-12T18:24:00Z"^^xsd:dateTime .
+:m005 flow:payloadKind :observation .
+:m005 flow:expectedResult 29 .
+:m005 flow:payloadGraph in:payload005 .
 
-in:formula1 {
+in:payload001 {
   _:m001b0 a sosa:Observation .
   _:m001b0 sosa:madeBySensor :thermometerA .
-  _:m001b0 sosa:resultTime "2026-05-12T18:20:00Z" .
+  _:m001b0 sosa:resultTime "2026-05-12T18:20:00Z"^^xsd:dateTime .
   _:m001b0 sosa:hasSimpleResult 21 .
 }
 
-in:formula2 {
+in:payload002 {
   _:m002b0 a sosa:Observation .
   _:m002b0 sosa:madeBySensor :thermometerA .
-  _:m002b0 sosa:resultTime "2026-05-12T18:21:00Z" .
+  _:m002b0 sosa:resultTime "2026-05-12T18:21:00Z"^^xsd:dateTime .
   _:m002b0 sosa:hasSimpleResult 22 .
 }
 
-in:formula3 {
+in:payload004 {
   _:m004b0 a sosa:Observation .
   _:m004b0 sosa:madeBySensor :thermometerA .
-  _:m004b0 sosa:resultTime "2026-05-12T18:23:00Z" .
+  _:m004b0 sosa:resultTime "2026-05-12T18:23:00Z"^^xsd:dateTime .
   _:m004b0 sosa:hasSimpleResult 28 .
 }
 
-in:formula4 {
+in:payload005 {
   _:m005b0 a sosa:Observation .
   _:m005b0 sosa:madeBySensor :thermometerA .
-  _:m005b0 sosa:resultTime "2026-05-12T18:24:00Z" .
+  _:m005b0 sosa:resultTime "2026-05-12T18:24:00Z"^^xsd:dateTime .
   _:m005b0 sosa:hasSimpleResult 29 .
 }
 
@@ -88,13 +122,7 @@ in:metadata {
   in:run a see:InputDataset .
   in:run see:name "rdf_message_flow" .
   in:run see:title "RDF Message Flow" .
-  in:run see:sourceFile "examples/n3/rdf_message_flow.n3" .
-  in:run see:sourceSHA256 "e4e534c8ac3c2aa276e7158cca8d3146531879033f73685c302b486be2ab0099" .
-  in:run see:description "A companion to rdf_messages.n3. This example focuses on a live stream where\nRDF Messages continuously flow through a small processing pipeline. The next\nmessage is released only after the current message reaches the sink, so the\nstream behaves as an ordered, replayable flow rather than a single merged RDF\ngraph." .
+  in:run see:sourceFile "examples/rdf-message-flow.n3" .
+  in:run see:description "A single Eyeling example split across an N3 rule file and a TriG input sidecar. It models an ordered RDF Message Stream using application-level envelopes and named payload graphs so that each payload can be interpreted atomically without merging all message contents into one graph." .
   in:run see:compiler "Eyeling RDF/TriG input sidecar" .
-  in:run see:inputFacts 42 .
-  in:run see:compiledRules 9 .
-  in:run see:compiledBackwardRules 0 .
-  in:run see:compiledFuses 0 .
-  in:run see:compiledQueries 1 .
 }

package/examples/input/rdf-message-microgrid.trig

@@ -0,0 +1,89 @@
+# ===================================
+# RDF Message Microgrid input sidecar
+# ===================================
+#
+# This file is the data half of the runnable example:
+#
+#   eyeling -r examples/rdf-message-microgrid.n3 examples/input/rdf-message-microgrid.trig
+#
+# The scene is a clinic operating as an islanded microgrid after a storm. The
+# data arrives as a replayable stream of atomic messages: life-safety loads,
+# power status, flexible demand, and an empty heartbeat. The default graph holds
+# application-local envelope facts, while each non-empty message payload is kept
+# in a named graph.
+#
+# The envelope IRIs are not RDF Message identifiers defined by the specification;
+# they are local replay records for this example. The named graphs are the
+# datasets/messages interpreted atomically by the N3 rules.
+
+@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 see: <https://example.org/see#> .
+@prefix in: <https://example.org/see/input#> .
+
+:stormClinicLog a rmsg:MessageLog .
+:stormClinicLog rmsg:orderedMessages (:m001 :m002 :m003 :m004) .
+:stormClinicLog rmsg:message :m001 .
+:stormClinicLog rmsg:message :m002 .
+:stormClinicLog rmsg:message :m003 .
+:stormClinicLog rmsg:message :m004 .
+:stormClinicLog rmsg:retentionPolicy "storm replay archive" .
+
+:m001 a rmsg:MessageEnvelope .
+:m001 rmsg:offset 1 .
+:m001 prov:generatedAtTime "2026-05-15T19:00:00Z"^^xsd:dateTime .
+:m001 rmsg:payloadKind :lifeSafetyLoads .
+:m001 rmsg:payloadGraph in:lifeSafetyPayload .
+
+:m002 a rmsg:MessageEnvelope .
+:m002 rmsg:offset 2 .
+:m002 prov:generatedAtTime "2026-05-15T19:01:00Z"^^xsd:dateTime .
+:m002 rmsg:payloadKind :powerStatus .
+:m002 rmsg:payloadGraph in:powerPayload .
+
+:m003 a rmsg:MessageEnvelope .
+:m003 rmsg:offset 3 .
+:m003 prov:generatedAtTime "2026-05-15T19:02:00Z"^^xsd:dateTime .
+:m003 rmsg:payloadKind :flexibleDemand .
+:m003 rmsg:payloadGraph in:flexPayload .
+
+:m004 a rmsg:MessageEnvelope .
+:m004 rmsg:offset 4 .
+:m004 prov:generatedAtTime "2026-05-15T19:03:00Z"^^xsd:dateTime .
+:m004 rmsg:payloadKind :heartbeat .
+
+in:lifeSafetyPayload {
+  :oxygenConcentrator a :LifeSafetyLoad .
+  :oxygenConcentrator :requiresWatts 500 .
+  :oxygenConcentrator :serves :respiratoryCareRoom .
+
+  :vaccineFridge a :ColdChainLoad .
+  :vaccineFridge :requiresWatts 120 .
+  :vaccineFridge :serves :vaccineColdChain .
+}
+
+in:powerPayload {
+  :batteryBank a :PowerReserve .
+  :batteryBank :availableWatts 650 .
+  :batteryBank :state :islanded .
+
+  :solarForecast a :NearTermForecast .
+  :solarForecast :expectedWatts 150 .
+}
+
+in:flexPayload {
+  :evChargers a :FlexibleLoad .
+  :evChargers :shedWatts 600 .
+  :evChargers :serves :staffVehicles .
+}
+
+in:metadata {
+  in:run a see:InputDataset .
+  in:run see:name "rdf_message_microgrid" .
+  in:run see:title "RDF Message Microgrid" .
+  in:run see:sourceFile "examples/rdf-message-microgrid.n3" .
+  in:run see:description "A storm clinic microgrid example using application-local RDF Message envelopes and named payload graphs so a reasoner can make a bounded, explainable load-shedding decision." .
+  in:run see:compiler "Eyeling RDF/TriG input sidecar" .
+}