eyeling 1.12.4 → 1.12.5

package/HANDBOOK.md

@@ -27,6 +27,7 @@
 - [Epilogue](#epilogue)
 - [Appendix A — Eyeling user notes](#app-a)
 - [Appendix B — Notation 3: when facts can carry their own logic](#app-b)
+- [Appendix C — N3 beyond Prolog: logic that survives the open web](#app-c)
 
 ---
 
@@ -1948,3 +1949,22 @@ The comparison with older tools is historically instructive. Cwm (Closed World M
 What motivates Notation 3, in the end, is architectural restraint. It refuses to let “logic” become merely a private feature of an application stack. It keeps meaning close to the graph: rules are expressed as graph patterns; results are expressed as triples; computation is pulled in through well-defined built-ins rather than arbitrary code. This produces a style of working where integration and inference are not sidecar scripts, but publishable artifacts—documents that can be inspected, shared, tested, and reused.
 
 In that sense, N3 is less a bid to make the web “smarter” than a bid to make meaning _portable_: not only facts that travel, but also the explicit steps by which facts can be connected, extended, and made actionable—without abandoning the simplicity that made triples travel in the first place.
+
+---  
+
+## Appendix C — N3 beyond Prolog: logic that survives the open web
+
+At first glance, an N3 rule set can feel familiar if you’ve used Prolog: variables, unification, and rules that read like “if this pattern holds, then that pattern follows.” But N3 is not just “logic programming with a different syntax.” It is logic shaped for a different environment: not a single program with a single database, but a world of distributed graphs that can be published, merged, and cited across boundaries.
+
+That change of environment forces a change in what “beyond Prolog” even means. It is less about being more powerful in the abstract, and more about being *more portable as meaning* — logic that stays connected when it moves between documents, vocabularies, and authors.
+
+Several design moves push N3 into that web-native space:
+
+- **Global identity is the default.** Names are IRIs. A rule does not merely compute with local symbols; it operates over identifiers meant to be shared across datasets.
+- **Graphs are the unit of exchange.** The input is a graph; the output is a graph. Inference produces new triples rather than hidden internal state, so results can travel the same way the facts do.
+- **Statements can be treated as data.** Quoted graphs let you talk *about* assertions: claims, policies, provenance, “this source says …,” “this formula implies …,” and other meta-level structure that is awkward in a plain predicate database.
+- **Rules can be publishable artifacts.** Rules can live alongside data as text, be versioned, reviewed, and reused — the “meaning” is not forced back into an external codebase.
+- **Web-like computation can be pulled into rule bodies.** Built-ins make room for the small computations that real integration needs (strings, lists, comparisons), and some N3 workflows even treat IRIs as pointers to more knowledge.
+
+In that sense, Prolog is a superb engine for proving things *inside* a chosen world. N3 is a way to write rules so they keep working *across* worlds: across documents, across graph boundaries, and across the open-ended growth of linked data. When an engine like Eyeling solves rule bodies with a Prolog-like prover but still saturates forward consequences, it’s exactly this bridge: Prolog-style execution serving a web-scale, graph-first notion of meaning.
+

package/examples/output/patch.n3

@@ -0,0 +1,10 @@
+@prefix : <http://example.org/> .
+@prefix rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#> .
+
+:patch1 :result {
+    :alice a :Person .
+    :bob a :Person .
+    :alice :age 31 .
+    :alice :status :ActiveStatus .
+    :alice :verified true .
+} .

package/examples/patch.n3

@@ -0,0 +1,55 @@
+# ===================================================================
+# N3 graph patch example
+# - Removes every triple from :source that is also present in :delete
+# - Then adds all triples from :insert
+# Uses only N3 builtins from the W3C spec:
+#   log:collectAllIn, log:conjunction, log:notIncludes
+# ===================================================================
+
+@prefix :    <http://example.org/> .
+@prefix log: <http://www.w3.org/2000/10/swap/log#> .
+
+:patch1
+  :source {
+    :alice a :Person ;
+           :age 30 ;
+           :status :OldStatus ;
+           :email "alice@example.org" .
+    :bob   a :Person .
+  } ;
+  :delete {
+    :alice :age 30 ;
+           :status :OldStatus ;
+           :email "alice@example.org" .
+  } ;
+  :insert {
+    :alice :age 31 ;
+           :status :ActiveStatus ;
+           :verified true .
+  } .
+
+{
+  :patch1 :source ?G ;
+          :delete ?Del ;
+          :insert ?Ins .
+
+  # Collect exactly the triples from ?G that are NOT included in the delete graph term ?Del
+  ( { ?S ?P ?O . }
+    {
+      ?S ?P ?O .
+      ?Del log:notIncludes { ?S ?P ?O . } .
+    }
+    ?keptTriples
+  ) log:collectAllIn ?G .
+
+  # Merge kept graph terms back into a single graph term
+  ?keptTriples log:conjunction ?keptGraph .
+
+  # Add the insert graph term
+  ( ?keptGraph ?Ins ) log:conjunction ?patched .
+}
+=>
+{
+  :patch1 :result ?patched .
+} .
+

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "eyeling",
-  "version": "1.12.4",
+  "version": "1.12.5",
   "description": "A minimal Notation3 (N3) reasoner in JavaScript.",
   "main": "./index.js",
   "keywords": [