eyeling 1.5.21 → 1.5.23

package/README.md

@@ -199,7 +199,6 @@ Supported:
 Non-goals / current limits:
 
 - not a full W3C N3 grammar (some edge cases for identifiers, quantifiers, advanced syntax)
-- quoted formulas are matched as whole formulas (no pattern matching inside formulas yet)
 - proof output is local per derived triple (not a global exported proof tree)
 
 ## Blank nodes and quantification (pragmatic N3/EYE-style)
@@ -243,7 +242,7 @@ As soon as the premise is provable, `eyeling` exits with status code `2`.
 `eyeling` implements a pragmatic subset of common N3 builtin families and evaluates them during backward goal proving:
 
 - **crypto**: `crypto:md5` `crypto:sha` `crypto:sha256` `crypto:sha512`
-- **list**: `list:append` `list:first` `list:firstRest` `list:in` `list:iterate` `list:last` `list:length` `list:map` `list:member` `list:memberAt` `list:notMember` `list:remove` `list:reverse` `list:sort`
+- **list**: `list:append` `list:first` `list:firstRest` `list:in` `list:iterate` `list:last` `list:length` `list:map` `list:member` `list:memberAt` `list:notMember` `list:remove` `list:rest` `list:reverse` `list:sort`
 - **log**: `log:collectAllIn` `log:equalTo` `log:forAllIn` `log:impliedBy` `log:implies` `log:notEqualTo` `log:notIncludes` `log:skolem` `log:uri`
 - **math**: `math:absoluteValue` `math:acos` `math:asin` `math:atan` `math:cos` `math:cosh` `math:degrees` `math:difference` `math:equalTo` `math:exponentiation` `math:greaterThan` `math:lessThan` `math:negation` `math:notEqualTo` `math:notGreaterThan` `math:notLessThan` `math:product` `math:quotient` `math:remainder` `math:rounded` `math:sin` `math:sinh` `math:sum` `math:tan` `math:tanh`
 - **string**: `string:concatenation` `string:contains` `string:containsIgnoringCase` `string:endsWith` `string:equalIgnoringCase` `string:format` `string:greaterThan` `string:lessThan` `string:matches` `string:notEqualIgnoringCase` `string:notGreaterThan` `string:notLessThan` `string:notMatches` `string:replace` `string:scrape` `string:startsWith`

package/examples/expression-eval.n3

@@ -13,7 +13,6 @@
 # -----------------------------
 # Data: (2 * 3) + (10 - 4) = 12
 # -----------------------------
-
 :n2  :n 2.
 :n3  :n 3.
 :n10 :n 10.
@@ -28,7 +27,6 @@
 # ----------------------
 # Backward rules: :value
 # ----------------------
-
 # Base case: numeric node
 { ?N :value ?V. } <= { ?N :n ?V. }.
 
@@ -65,6 +63,5 @@
 # ------------------------------
 # Forward rule: emit final value
 # ------------------------------
-
 { :Root :expr ?E. ?E :value ?V. } => { :Root :result ?V. }.
 

package/examples/family-cousins.n3

@@ -8,7 +8,6 @@
 # --------------------------
 # Data (a small family tree)
 # --------------------------
-
 :Adam  :parentOf :Bob, :Carol .
 :Bob   :parentOf :Dave, :Eve .
 :Carol :parentOf :Frank, :Grace .
@@ -29,7 +28,6 @@
 # -----------------------------------
 # Rules (generation, branch, cousins)
 # -----------------------------------
-
 # Root generation
 { } => { :Adam :generation 0 } .
 

package/examples/gps.n3

@@ -7,45 +7,42 @@
 
 @prefix math: <http://www.w3.org/2000/10/swap/math#>.
 @prefix list: <http://www.w3.org/2000/10/swap/list#>.
-@prefix gps: <https://eyereasoner.github.io/eye/reasoning/gps/gps-schema#>.
-@prefix : <https://eyereasoner.github.io/eye/reasoning#>.
-
-# ---------------------
-# Data (a small sample)
-# ---------------------
+@prefix gps:  <https://eyereasoner.github.io/eye/reasoning/gps/gps-schema#>.
+@prefix :     <https://eyereasoner.github.io/eye/reasoning#>.
 
 # current state
 :i1 :location :Gent.
 
-# map of Belgium
-(:Gent :Brugge   :drive_gent_brugge     1500.0 0.006 0.96 0.99) :edge true .
-(:Gent :Kortrijk :drive_gent_kortrijk   1600.0 0.007 0.96 0.99) :edge true .
-(:Kortrijk :Brugge :drive_kortrijk_brugge 1600.0 0.007 0.96 0.99) :edge true .
-(:Brugge :Oostende :drive_brugge_oostende  900.0 0.004 0.98 1.0) :edge true .
-
-# ----------------
-# Path computation
-# ----------------
+# -------------------------------------------------
+# map of Belgium (as backward rules / descriptions)
+# -------------------------------------------------
+{:map-BE gps:description ({?S :location :Gent}     true {?S :location :Brugge}   :drive_gent_brugge      1500.0 0.006 0.96 0.99)} <= true.
+{:map-BE gps:description ({?S :location :Gent}     true {?S :location :Kortrijk} :drive_gent_kortrijk    1600.0 0.007 0.96 0.99)} <= true.
+{:map-BE gps:description ({?S :location :Kortrijk} true {?S :location :Brugge}   :drive_kortrijk_brugge  1600.0 0.007 0.96 0.99)} <= true.
+{:map-BE gps:description ({?S :location :Brugge}   true {?S :location :Oostende} :drive_brugge_oostende   900.0 0.004 0.98 1.0 )} <= true.
 
-# Base: one edge is a path
+# -----------------------------
+# Compute all paths by chaining
+# -----------------------------
+# Base: a single map description is a path
 {
   (?From ?To (?Act) ?Dur ?Cost ?Belief ?Comfort) :path true.
 }
 <=
 {
-  (?From ?To ?Act ?Dur ?Cost ?Belief ?Comfort) :edge true.
+  :map-BE gps:description (?From true ?To ?Act ?Dur ?Cost ?Belief ?Comfort).
 }.
 
-# Recursive: edge + path => path, aggregate weights, concatenate action list
+# Recursive: chain one step + rest path, and aggregate weights
 {
-  (?From ?To ?Acts ?Dur ?Cost ?Belief ?Comfort) :path true.
+  (?From ?To ?Actions ?Dur ?Cost ?Belief ?Comfort) :path true.
 }
 <=
 {
-  (?From ?Mid ?Act ?Dur1 ?Cost1 ?Bel1 ?Comf1) :edge true.
+  :map-BE gps:description (?From true ?Mid ?Act ?Dur1 ?Cost1 ?Bel1 ?Comf1).
   (?Mid ?To ?RestActs ?Dur2 ?Cost2 ?Bel2 ?Comf2) :path true.
 
-  ((?Act) ?RestActs) list:append ?Acts.
+  ((?Act) ?RestActs) list:append ?Actions.
 
   (?Dur1  ?Dur2)  math:sum     ?Dur.
   (?Cost1 ?Cost2) math:sum     ?Cost.
@@ -53,13 +50,12 @@
   (?Comf1 ?Comf2) math:product ?Comfort.
 }.
 
-# -------------------------
-# Query: only paths to goal
-# -------------------------
-
+# ------------------------------------------------------
+# "Query": derive gps:path facts for i1, goal = Oostende
+# ------------------------------------------------------
 {
-  :i1 :location ?Start.
-  (?Start :Oostende ?Acts ?Dur ?Cost ?Bel ?Comf) :path true.
+  :i1 :location :Gent.
+  ({:i1 :location :Gent} {:i1 :location :Oostende} ?Acts ?Dur ?Cost ?Bel ?Comf) :path true.
 }
 =>
 {

package/examples/light-eaters.n3

@@ -10,7 +10,6 @@
 # convert daily light exposure into stored energy (photosynthesis),
 # then decide whether they thrive or go hungry under their conditions.
 # ------------------------------------------------------------
-
 # One day with a fixed amount of usable light (hours)
 :Today :lightHours 10.0.
 
@@ -26,7 +25,6 @@
 # ------------------------------------------------------------
 # Rules
 # ------------------------------------------------------------
-
 # (1) Daily light energy available at each place:
 #     E_place = lightIntensity * lightHours
 {

package/examples/list-builtins-tests.n3

@@ -10,7 +10,7 @@
 # 4.4 list: builtins
 # ============================================================
 
-# 4.4.1 list:append
+# list:append
 # ( (1 2) (3 4) ) list:append (1 2 3 4) .
 {
     ( (1 2) (3 4) ) list:append (1 2 3 4) .
@@ -18,7 +18,7 @@
     :ok_list_append_1 a :Pass .
 } .
 
-# 4.4.2 list:first
+# list:first
 # (1 2 3 4) list:first 1 .
 {
     (1 2 3 4) list:first 1 .
@@ -26,7 +26,7 @@
     :ok_list_first_1 a :Pass .
 } .
 
-# 4.4.3 list:in
+# list:in
 # "cat" list:in ( "dog" "penguin" "cat" ) .
 {
     "cat" list:in ( "dog" "penguin" "cat" ) .
@@ -34,7 +34,7 @@
     :ok_list_in_1 a :Pass .
 } .
 
-# 4.4.4 list:iterate
+# list:iterate
 # ("dog" "penguin" "cat") list:iterate (?index "cat") .
 {
     ("dog" "penguin" "cat") list:iterate (?index "cat") .
@@ -42,7 +42,7 @@
     :ok_list_iterate_1 a :Pass .
 } .
 
-# 4.4.5 list:last
+# list:last
 # (1 2 3 4) list:last 4 .
 {
     (1 2 3 4) list:last 4 .
@@ -50,7 +50,7 @@
     :ok_list_last_1 a :Pass .
 } .
 
-# 4.4.6 list:length
+# list:length
 # (1 2 3 4) list:length 4 .
 {
     (1 2 3 4) list:length 4 .
@@ -58,7 +58,7 @@
     :ok_list_length_1 a :Pass .
 } .
 
-# 4.4.7 list:member
+# list:member
 # ("dog" "penguin" "cat") list:member "cat" .
 {
     ("dog" "penguin" "cat") list:member "cat" .
@@ -66,7 +66,7 @@
     :ok_list_member_1 a :Pass .
 } .
 
-# 4.4.8 list:memberAt
+# list:memberAt
 # (("dog" "penguin" "cat") 2) list:memberAt "cat" .
 {
     (("dog" "penguin" "cat") 2) list:memberAt "cat" .
@@ -74,7 +74,7 @@
     :ok_list_memberAt_1 a :Pass .
 } .
 
-# 4.4.9 list:remove
+# list:remove
 # (("dog" "penguin" "cat" "penguin") "penguin") list:remove ("dog" "cat") .
 {
     (("dog" "penguin" "cat" "penguin") "penguin") list:remove ("dog" "cat") .
@@ -82,3 +82,19 @@
     :ok_list_remove_1 a :Pass .
 } .
 
+# list:rest
+# (1 2 3 4) list:rest (2 3 4) .
+{
+    (1 2 3 4) list:rest (2 3 4) .
+} => {
+    :ok_list_rest_1 a :Pass .
+} .
+
+# list:firstRest
+# (1 2 3 4) list:firstRest (1 (2 3 4)) .
+{
+    (1 2 3 4) list:firstRest (1 (2 3 4)) .
+} => {
+    :ok_list_firstRest_1 a :Pass .
+} .
+

package/examples/odrl-trust.n3

@@ -10,7 +10,6 @@
 # ------------------
 # Trust model (0..1)
 # ------------------
-
 :Gov        :trust 0.95.
 :Partner    :trust 0.70.
 :RandomBlog :trust 0.30.
@@ -18,7 +17,6 @@
 # ---------------------------
 # A request we want to decide
 # ---------------------------
-
 :req1 a :Request;
   odrl:assignee :Alice;
   odrl:target   :Doc1;
@@ -27,7 +25,6 @@
 # -------------
 # ODRL Policies
 # -------------
-
 # High-trust permission from Gov (trusted enough)
 :PolGov a odrl:Policy;
   dct:creator :Gov;
@@ -79,7 +76,6 @@
 # --------------------------------
 # Minimal "ODRL + trust" evaluator
 # --------------------------------
-
 # Candidate PERMIT for a request, scored by issuer trust, only if trust >= minTrust
 {
   (?Req odrl:permit ?Score) :cand true.

package/examples/output/gps.n3

@@ -6,11 +6,19 @@
 #   :i1 gps:path ((:drive_gent_kortrijk :drive_kortrijk_brugge :drive_brugge_oostende) 4100 0.018 0.903168 0.9801) .
 # It holds because the following instance of the rule body is provable:
 #   :i1 :location :Gent .
-#   (:Gent :Oostende (:drive_gent_kortrijk :drive_kortrijk_brugge :drive_brugge_oostende) 4100 0.018 0.903168 0.9801) :path true .
+#   ({
+#       :i1 :location :Gent .
+#   } {
+#       :i1 :location :Oostende .
+#   } (:drive_gent_kortrijk :drive_kortrijk_brugge :drive_brugge_oostende) 4100 0.018 0.903168 0.9801) :path true .
 # via the schematic forward rule:
 #   {
-#     :i1 :location ?Start .
-#     (?Start :Oostende ?Acts ?Dur ?Cost ?Bel ?Comf) :path true .
+#     :i1 :location :Gent .
+#     ({
+#         :i1 :location :Gent .
+#     } {
+#         :i1 :location :Oostende .
+#     } ?Acts ?Dur ?Cost ?Bel ?Comf) :path true .
 #   } => {
 #     :i1 gps:path (?Acts ?Dur ?Cost ?Bel ?Comf) .
 #   } .
@@ -20,7 +28,6 @@
 #   ?Comf = 0.9801
 #   ?Cost = 0.018
 #   ?Dur = 4100
-#   ?Start = :Gent
 # Therefore the derived triple above is entailed by the rules and facts.
 # ----------------------------------------------------------------------
 
@@ -31,11 +38,19 @@
 #   :i1 gps:path ((:drive_gent_brugge :drive_brugge_oostende) 2400 0.01 0.9408 0.99) .
 # It holds because the following instance of the rule body is provable:
 #   :i1 :location :Gent .
-#   (:Gent :Oostende (:drive_gent_brugge :drive_brugge_oostende) 2400 0.01 0.9408 0.99) :path true .
+#   ({
+#       :i1 :location :Gent .
+#   } {
+#       :i1 :location :Oostende .
+#   } (:drive_gent_brugge :drive_brugge_oostende) 2400 0.01 0.9408 0.99) :path true .
 # via the schematic forward rule:
 #   {
-#     :i1 :location ?Start .
-#     (?Start :Oostende ?Acts ?Dur ?Cost ?Bel ?Comf) :path true .
+#     :i1 :location :Gent .
+#     ({
+#         :i1 :location :Gent .
+#     } {
+#         :i1 :location :Oostende .
+#     } ?Acts ?Dur ?Cost ?Bel ?Comf) :path true .
 #   } => {
 #     :i1 gps:path (?Acts ?Dur ?Cost ?Bel ?Comf) .
 #   } .
@@ -45,7 +60,6 @@
 #   ?Comf = 0.99
 #   ?Cost = 0.01
 #   ?Dur = 2400
-#   ?Start = :Gent
 # Therefore the derived triple above is entailed by the rules and facts.
 # ----------------------------------------------------------------------
 

package/examples/output/list-builtins-tests.n3

@@ -146,3 +146,35 @@
 
 :ok_list_remove_1 a :Pass .
 
+# ----------------------------------------------------------------------
+# Proof for derived triple:
+#   :ok_list_rest_1 a :Pass .
+# It holds because the following instance of the rule body is provable:
+#   (1 2 3 4) list:rest (2 3 4) .
+# via the schematic forward rule:
+#   {
+#     (1 2 3 4) list:rest (2 3 4) .
+#   } => {
+#     :ok_list_rest_1 a :Pass .
+#   } .
+# Therefore the derived triple above is entailed by the rules and facts.
+# ----------------------------------------------------------------------
+
+:ok_list_rest_1 a :Pass .
+
+# ----------------------------------------------------------------------
+# Proof for derived triple:
+#   :ok_list_firstRest_1 a :Pass .
+# It holds because the following instance of the rule body is provable:
+#   (1 2 3 4) list:firstRest (1 (2 3 4)) .
+# via the schematic forward rule:
+#   {
+#     (1 2 3 4) list:firstRest (1 (2 3 4)) .
+#   } => {
+#     :ok_list_firstRest_1 a :Pass .
+#   } .
+# Therefore the derived triple above is entailed by the rules and facts.
+# ----------------------------------------------------------------------
+
+:ok_list_firstRest_1 a :Pass .
+

package/examples/spectral-week.n3

@@ -9,7 +9,6 @@
 # ------------------------------------------------------------
 # Spectral light intake (red + blue) and weekly energy storage
 # ------------------------------------------------------------
-
 # Locations: daily hours of red/blue light, and intensity per hour.
 :Greenhouse :redHours 8.0;  :blueHours 2.0;
             :redIntensity  120.0;
@@ -32,7 +31,6 @@
 #   Ered  = redIntensity  * redHours
 #   Eblue = blueIntensity * blueHours
 # ------------------------------------
-
 {
   ?Loc :redIntensity ?RI; :redHours ?RH.
   (?RI ?RH) math:product ?Ered.
@@ -53,7 +51,6 @@
 #   Ablue = Loc.blueEnergy * Plant.absorbBlue
 #   absorbed = Ared + Ablue
 # -------------------------------------------
-
 {
   ?P a :Plant; :location ?Loc; :absorbRed ?AR.
   ?Loc :redEnergy ?Ered.
@@ -81,7 +78,6 @@
 # -------------------------------------------------
 # Daily stored energy = absorbedEnergy * conversion
 # -------------------------------------------------
-
 {
   ?P :absorbedEnergy ?Abs; :conversion ?C.
   (?Abs ?C) math:product ?Stored.
@@ -92,7 +88,6 @@
 # ------------------------------------
 # Weekly stored energy = dailyStored*7
 # ------------------------------------
-
 {
   ?P :dailyStored ?D.
   (?D 7) math:product ?W.

package/eyeling.js

@@ -1463,6 +1463,40 @@ function unifyOpenWithList(prefix, tailv, ys, subst) {
   return s2;
 }
 
+function unifyFormulaTriples(xs, ys, subst) {
+  if (xs.length !== ys.length) return null;
+
+  // Fast path: exact same sequence.
+  if (triplesListEqual(xs, ys)) return { ...subst };
+
+  // Backtracking match (order-insensitive), *threading* the substitution through.
+  const used = new Array(ys.length).fill(false);
+
+  function step(i, s) {
+    if (i >= xs.length) return s;
+    const x = xs[i];
+
+    for (let j = 0; j < ys.length; j++) {
+      if (used[j]) continue;
+      const y = ys[j];
+
+      // Cheap pruning when both predicates are IRIs.
+      if (x.p instanceof Iri && y.p instanceof Iri && x.p.value !== y.p.value) continue;
+
+      const s2 = unifyTriple(x, y, s);   // IMPORTANT: use `s`, not {}
+      if (s2 === null) continue;
+
+      used[j] = true;
+      const s3 = step(i + 1, s2);
+      if (s3 !== null) return s3;
+      used[j] = false;
+    }
+    return null;
+  }
+
+  return step(0, { ...subst }); // IMPORTANT: start from the incoming subst
+}
+
 function unifyTerm(a, b, subst) {
   a = applySubstTerm(a, subst);
   b = applySubstTerm(b, subst);
@@ -1521,11 +1555,10 @@ function unifyTerm(a, b, subst) {
     return s2;
   }
 
-  // Formulas are treated as opaque unless exactly equal
+  // Formulas: unify their internal triple sets (order-insensitive)
   if (a instanceof FormulaTerm && b instanceof FormulaTerm) {
-    if (triplesListEqual(a.triples, b.triples)) return { ...subst };
+    return unifyFormulaTriples(a.triples, b.triples, subst);
   }
-
   return null;
 }
 
@@ -2525,6 +2558,36 @@ function evalBuiltin(goal, subst, facts, backRules, depth, varGen) {
     return s2 !== null ? [s2] : [];
   }
 
+  // list:rest
+  // true iff $s is a (non-empty) list and $o is the rest (tail) of that list.
+  // Schema: $s+ list:rest $o-
+  if (g.p instanceof Iri && g.p.value === LIST_NS + "rest") {
+    // Closed list: (a b c) -> (b c)
+    if (g.s instanceof ListTerm) {
+      if (!g.s.elems.length) return [];
+      const rest = new ListTerm(g.s.elems.slice(1));
+      const s2 = unifyTerm(g.o, rest, subst);
+      return s2 !== null ? [s2] : [];
+    }
+
+    // Open list: (a b ... ?T) -> (b ... ?T)
+    if (g.s instanceof OpenListTerm) {
+      if (!g.s.prefix.length) return []; // can't compute rest without a known head
+
+      if (g.s.prefix.length === 1) {
+        // (a ... ?T) rest is exactly ?T
+        const s2 = unifyTerm(g.o, new Var(g.s.tailVar), subst);
+        return s2 !== null ? [s2] : [];
+      }
+
+      const rest = new OpenListTerm(g.s.prefix.slice(1), g.s.tailVar);
+      const s2 = unifyTerm(g.o, rest, subst);
+      return s2 !== null ? [s2] : [];
+    }
+
+    return [];
+  }
+
   // list:iterate
   // true iff $s is a list and $o is a list (index value),
   // where index is a valid 0-based index into $s and value is the element at that index.

package/package.json

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