eyeling 1.22.13 → 1.22.14

package/HANDBOOK.md

@@ -436,6 +436,8 @@ Important scope nuance: only blanks/variables that are local to the quoted formu
 
 So `{ _:x :p :o }` obtained by substituting `?A = _:x` into `{ ?A :p :o }` must not alpha-match `{ _:b :p :o }` by renaming `_:x` to `_:b`.
 
+A related operational detail matters for rule execution: alpha-equivalence is only a **binding-free shortcut** when both quoted formulas are variable-free after substitution. If unbound variables still remain inside the formulas, Eyeling must fall back to structural quoted-formula unification so shared outer rule variables can actually bind. Otherwise a premise such as `?A :has { ?S ?P ?O }` could appear to match while leaving `?S ?P ?O` unbound for later goals.
+
 ### 6.2 Groundness: “variables inside formulas do not leak”
 
 Eyeling makes a deliberate choice about _groundness_:

package/dist/browser/eyeling.browser.js

@@ -7625,6 +7625,22 @@
       return s2;
     }
 
+    function graphTriplesContainVars(triples) {
+      function termHasVar(t) {
+        if (t instanceof Var) return true;
+        if (t instanceof ListTerm) return t.elems.some(termHasVar);
+        if (t instanceof OpenListTerm) return t.prefix.some(termHasVar) || true;
+        if (t instanceof GraphTerm)
+          return t.triples.some((tr) => termHasVar(tr.s) || termHasVar(tr.p) || termHasVar(tr.o));
+        return false;
+      }
+
+      for (const tr of triples) {
+        if (termHasVar(tr.s) || termHasVar(tr.p) || termHasVar(tr.o)) return true;
+      }
+      return false;
+    }
+
     function unifyGraphTriples(xs, ys, subst) {
       if (xs.length !== ys.length) return null;
 
@@ -7786,17 +7802,22 @@
 
       // Graphs
       if (a instanceof GraphTerm && b instanceof GraphTerm) {
-        const protectedNamesA = collectProtectedNamesForTerm(aRaw, subst);
-        const protectedNamesB = collectProtectedNamesForTerm(bRaw, subst);
-        if (
-          alphaEqGraphTriples(a.triples, b.triples, {
-            protectedVarsA: protectedNamesA.protectedVars,
-            protectedVarsB: protectedNamesB.protectedVars,
-            protectedBlanksA: protectedNamesA.protectedBlanks,
-            protectedBlanksB: protectedNamesB.protectedBlanks,
-          })
-        ) {
-          return subst;
+        // Only use alpha-equivalence as a binding-free fast path when both quoted
+        // formulas are variable-free after substitution. If unbound variables remain,
+        // they may be shared with the outer rule and must unify/bind structurally.
+        if (!graphTriplesContainVars(a.triples) && !graphTriplesContainVars(b.triples)) {
+          const protectedNamesA = collectProtectedNamesForTerm(aRaw, subst);
+          const protectedNamesB = collectProtectedNamesForTerm(bRaw, subst);
+          if (
+            alphaEqGraphTriples(a.triples, b.triples, {
+              protectedVarsA: protectedNamesA.protectedVars,
+              protectedVarsB: protectedNamesB.protectedVars,
+              protectedBlanksA: protectedNamesA.protectedBlanks,
+              protectedBlanksB: protectedNamesB.protectedBlanks,
+            })
+          ) {
+            return subst;
+          }
         }
         return unifyGraphTriples(a.triples, b.triples, subst);
       }
@@ -8177,17 +8198,22 @@
 
         // Graphs
         if (a instanceof GraphTerm && b instanceof GraphTerm) {
-          const protectedNamesA = collectProtectedNamesForTerm(aRaw, substMut);
-          const protectedNamesB = collectProtectedNamesForTerm(bRaw, substMut);
-          if (
-            alphaEqGraphTriples(a.triples, b.triples, {
-              protectedVarsA: protectedNamesA.protectedVars,
-              protectedVarsB: protectedNamesB.protectedVars,
-              protectedBlanksA: protectedNamesA.protectedBlanks,
-              protectedBlanksB: protectedNamesB.protectedBlanks,
-            })
-          ) {
-            return true;
+          // Only use alpha-equivalence as a binding-free fast path when both quoted
+          // formulas are variable-free after substitution. If unbound variables remain,
+          // they may be shared with the outer rule and must unify/bind structurally.
+          if (!graphTriplesContainVars(a.triples) && !graphTriplesContainVars(b.triples)) {
+            const protectedNamesA = collectProtectedNamesForTerm(aRaw, substMut);
+            const protectedNamesB = collectProtectedNamesForTerm(bRaw, substMut);
+            if (
+              alphaEqGraphTriples(a.triples, b.triples, {
+                protectedVarsA: protectedNamesA.protectedVars,
+                protectedVarsB: protectedNamesB.protectedVars,
+                protectedBlanksA: protectedNamesA.protectedBlanks,
+                protectedBlanksB: protectedNamesB.protectedBlanks,
+              })
+            ) {
+              return true;
+            }
           }
           const merged = unifyGraphTriples(a.triples, b.triples, substMut);
           if (merged === null) return false;

package/eyeling.js

@@ -7605,6 +7605,22 @@ function unifyOpenWithList(prefix, tailv, ys, subst) {
   return s2;
 }
 
+
+function graphTriplesContainVars(triples) {
+  function termHasVar(t) {
+    if (t instanceof Var) return true;
+    if (t instanceof ListTerm) return t.elems.some(termHasVar);
+    if (t instanceof OpenListTerm) return t.prefix.some(termHasVar) || true;
+    if (t instanceof GraphTerm) return t.triples.some((tr) => termHasVar(tr.s) || termHasVar(tr.p) || termHasVar(tr.o));
+    return false;
+  }
+
+  for (const tr of triples) {
+    if (termHasVar(tr.s) || termHasVar(tr.p) || termHasVar(tr.o)) return true;
+  }
+  return false;
+}
+
 function unifyGraphTriples(xs, ys, subst) {
   if (xs.length !== ys.length) return null;
 
@@ -7766,17 +7782,22 @@ function unifyTermWithOptions(a, b, subst, opts) {
 
   // Graphs
   if (a instanceof GraphTerm && b instanceof GraphTerm) {
-    const protectedNamesA = collectProtectedNamesForTerm(aRaw, subst);
-    const protectedNamesB = collectProtectedNamesForTerm(bRaw, subst);
-    if (
-      alphaEqGraphTriples(a.triples, b.triples, {
-        protectedVarsA: protectedNamesA.protectedVars,
-        protectedVarsB: protectedNamesB.protectedVars,
-        protectedBlanksA: protectedNamesA.protectedBlanks,
-        protectedBlanksB: protectedNamesB.protectedBlanks,
-      })
-    ) {
-      return subst;
+    // Only use alpha-equivalence as a binding-free fast path when both quoted
+    // formulas are variable-free after substitution. If unbound variables remain,
+    // they may be shared with the outer rule and must unify/bind structurally.
+    if (!graphTriplesContainVars(a.triples) && !graphTriplesContainVars(b.triples)) {
+      const protectedNamesA = collectProtectedNamesForTerm(aRaw, subst);
+      const protectedNamesB = collectProtectedNamesForTerm(bRaw, subst);
+      if (
+        alphaEqGraphTriples(a.triples, b.triples, {
+          protectedVarsA: protectedNamesA.protectedVars,
+          protectedVarsB: protectedNamesB.protectedVars,
+          protectedBlanksA: protectedNamesA.protectedBlanks,
+          protectedBlanksB: protectedNamesB.protectedBlanks,
+        })
+      ) {
+        return subst;
+      }
     }
     return unifyGraphTriples(a.triples, b.triples, subst);
   }
@@ -8157,17 +8178,22 @@ function proveGoals(goals, subst, facts, backRules, depth, visited, varGen, maxR
 
     // Graphs
     if (a instanceof GraphTerm && b instanceof GraphTerm) {
-      const protectedNamesA = collectProtectedNamesForTerm(aRaw, substMut);
-      const protectedNamesB = collectProtectedNamesForTerm(bRaw, substMut);
-      if (
-        alphaEqGraphTriples(a.triples, b.triples, {
-          protectedVarsA: protectedNamesA.protectedVars,
-          protectedVarsB: protectedNamesB.protectedVars,
-          protectedBlanksA: protectedNamesA.protectedBlanks,
-          protectedBlanksB: protectedNamesB.protectedBlanks,
-        })
-      ) {
-        return true;
+      // Only use alpha-equivalence as a binding-free fast path when both quoted
+      // formulas are variable-free after substitution. If unbound variables remain,
+      // they may be shared with the outer rule and must unify/bind structurally.
+      if (!graphTriplesContainVars(a.triples) && !graphTriplesContainVars(b.triples)) {
+        const protectedNamesA = collectProtectedNamesForTerm(aRaw, substMut);
+        const protectedNamesB = collectProtectedNamesForTerm(bRaw, substMut);
+        if (
+          alphaEqGraphTriples(a.triples, b.triples, {
+            protectedVarsA: protectedNamesA.protectedVars,
+            protectedVarsB: protectedNamesB.protectedVars,
+            protectedBlanksA: protectedNamesA.protectedBlanks,
+            protectedBlanksB: protectedNamesB.protectedBlanks,
+          })
+        ) {
+          return true;
+        }
       }
       const merged = unifyGraphTriples(a.triples, b.triples, substMut);
       if (merged === null) return false;
@@ -13004,7 +13030,8 @@ function liftBlankRuleVars(premise, conclusion) {
     if (t instanceof OpenListTerm) return new OpenListTerm(t.prefix.map(convertQuotedPatternTerm), t.tailVar);
     if (t instanceof GraphTerm) {
       const triples = t.triples.map(
-        (tr) => new Triple(convertQuotedPatternTerm(tr.s), convertQuotedPatternTerm(tr.p), convertQuotedPatternTerm(tr.o)),
+        (tr) =>
+          new Triple(convertQuotedPatternTerm(tr.s), convertQuotedPatternTerm(tr.p), convertQuotedPatternTerm(tr.o)),
       );
       return copyQuotedGraphMetadata(t, new GraphTerm(triples));
     }
@@ -13014,13 +13041,17 @@ function liftBlankRuleVars(premise, conclusion) {
   function convertTerm(t, allowDirectQuotedPattern = false) {
     if (t instanceof Blank) return blankToVar(t.label);
     if (t instanceof ListTerm) return new ListTerm(t.elems.map((e) => convertTerm(e, false)));
-    if (t instanceof OpenListTerm) return new OpenListTerm(t.prefix.map((e) => convertTerm(e, false)), t.tailVar);
+    if (t instanceof OpenListTerm)
+      return new OpenListTerm(
+        t.prefix.map((e) => convertTerm(e, false)),
+        t.tailVar,
+      );
     if (t instanceof GraphTerm) return allowDirectQuotedPattern ? convertQuotedPatternTerm(t) : copyQuotedTerm(t);
     return t;
   }
 
-  const newPremise = premise.map((tr) =>
-    new Triple(convertTerm(tr.s, true), convertTerm(tr.p, true), convertTerm(tr.o, true)),
+  const newPremise = premise.map(
+    (tr) => new Triple(convertTerm(tr.s, true), convertTerm(tr.p, true), convertTerm(tr.o, true)),
   );
   return [newPremise, conclusion];
 }

package/lib/engine.js

@@ -1795,6 +1795,21 @@ function unifyOpenWithList(prefix, tailv, ys, subst) {
   return s2;
 }
 
+function graphTriplesContainVars(triples) {
+  function termHasVar(t) {
+    if (t instanceof Var) return true;
+    if (t instanceof ListTerm) return t.elems.some(termHasVar);
+    if (t instanceof OpenListTerm) return t.prefix.some(termHasVar) || true;
+    if (t instanceof GraphTerm) return t.triples.some((tr) => termHasVar(tr.s) || termHasVar(tr.p) || termHasVar(tr.o));
+    return false;
+  }
+
+  for (const tr of triples) {
+    if (termHasVar(tr.s) || termHasVar(tr.p) || termHasVar(tr.o)) return true;
+  }
+  return false;
+}
+
 function unifyGraphTriples(xs, ys, subst) {
   if (xs.length !== ys.length) return null;
 
@@ -1956,17 +1971,22 @@ function unifyTermWithOptions(a, b, subst, opts) {
 
   // Graphs
   if (a instanceof GraphTerm && b instanceof GraphTerm) {
-    const protectedNamesA = collectProtectedNamesForTerm(aRaw, subst);
-    const protectedNamesB = collectProtectedNamesForTerm(bRaw, subst);
-    if (
-      alphaEqGraphTriples(a.triples, b.triples, {
-        protectedVarsA: protectedNamesA.protectedVars,
-        protectedVarsB: protectedNamesB.protectedVars,
-        protectedBlanksA: protectedNamesA.protectedBlanks,
-        protectedBlanksB: protectedNamesB.protectedBlanks,
-      })
-    ) {
-      return subst;
+    // Only use alpha-equivalence as a binding-free fast path when both quoted
+    // formulas are variable-free after substitution. If unbound variables remain,
+    // they may be shared with the outer rule and must unify/bind structurally.
+    if (!graphTriplesContainVars(a.triples) && !graphTriplesContainVars(b.triples)) {
+      const protectedNamesA = collectProtectedNamesForTerm(aRaw, subst);
+      const protectedNamesB = collectProtectedNamesForTerm(bRaw, subst);
+      if (
+        alphaEqGraphTriples(a.triples, b.triples, {
+          protectedVarsA: protectedNamesA.protectedVars,
+          protectedVarsB: protectedNamesB.protectedVars,
+          protectedBlanksA: protectedNamesA.protectedBlanks,
+          protectedBlanksB: protectedNamesB.protectedBlanks,
+        })
+      ) {
+        return subst;
+      }
     }
     return unifyGraphTriples(a.triples, b.triples, subst);
   }
@@ -2347,17 +2367,22 @@ function proveGoals(goals, subst, facts, backRules, depth, visited, varGen, maxR
 
     // Graphs
     if (a instanceof GraphTerm && b instanceof GraphTerm) {
-      const protectedNamesA = collectProtectedNamesForTerm(aRaw, substMut);
-      const protectedNamesB = collectProtectedNamesForTerm(bRaw, substMut);
-      if (
-        alphaEqGraphTriples(a.triples, b.triples, {
-          protectedVarsA: protectedNamesA.protectedVars,
-          protectedVarsB: protectedNamesB.protectedVars,
-          protectedBlanksA: protectedNamesA.protectedBlanks,
-          protectedBlanksB: protectedNamesB.protectedBlanks,
-        })
-      ) {
-        return true;
+      // Only use alpha-equivalence as a binding-free fast path when both quoted
+      // formulas are variable-free after substitution. If unbound variables remain,
+      // they may be shared with the outer rule and must unify/bind structurally.
+      if (!graphTriplesContainVars(a.triples) && !graphTriplesContainVars(b.triples)) {
+        const protectedNamesA = collectProtectedNamesForTerm(aRaw, substMut);
+        const protectedNamesB = collectProtectedNamesForTerm(bRaw, substMut);
+        if (
+          alphaEqGraphTriples(a.triples, b.triples, {
+            protectedVarsA: protectedNamesA.protectedVars,
+            protectedVarsB: protectedNamesB.protectedVars,
+            protectedBlanksA: protectedNamesA.protectedBlanks,
+            protectedBlanksB: protectedNamesB.protectedBlanks,
+          })
+        ) {
+          return true;
+        }
       }
       const merged = unifyGraphTriples(a.triples, b.triples, substMut);
       if (merged === null) return false;

package/package.json

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

package/test/api.test.js

@@ -2278,6 +2278,34 @@ _:b a ex:Person ; ex:name "B" .
 {
   :test :is true .
 }.
+`,
+    expect: [/^:test\s+:is\s+true\s*\./m],
+  },
+  {
+    name: 'regression: quoted-formula backward-rule heads must bind shared variables for later goals',
+    opt: { proofComments: false },
+    input: `@prefix : <http://example.org/> .
+@prefix log: <http://www.w3.org/2000/10/swap/log#> .
+
+{ :a :b :c } a :Statement .
+
+{ ?A :has { ?S ?P ?O } }
+<=
+{
+  ?A log:includes { ?S ?P ?O }.
+}.
+
+{
+  ?A a :Statement .
+  ?A :has { ?S ?P ?O }.
+  ?S log:rawType log:Other.
+  ?P log:rawType log:Other.
+  ?O log:rawType log:Other.
+}
+=>
+{
+  :test :is true .
+}.
 `,
     expect: [/^:test\s+:is\s+true\s*\./m],
   },