eyeling 1.5.19 → 1.5.21

package/examples/expression-eval.n3

@@ -0,0 +1,70 @@
+# ---------------------------------
+# A tiny expression evaluator in N3
+# ---------------------------------
+#
+# - numbers are nodes with :n
+# - expressions are nodes with :op, :left, :right
+# - :value is defined as a backward “builtin-like” predicate (<=) with recursion
+# - one forward rule emits the final result
+
+@prefix math: <http://www.w3.org/2000/10/swap/math#>.
+@prefix :     <http://example.org/expression-eval#>.
+
+# -----------------------------
+# Data: (2 * 3) + (10 - 4) = 12
+# -----------------------------
+
+:n2  :n 2.
+:n3  :n 3.
+:n10 :n 10.
+:n4  :n 4.
+
+:eMul a :Expr; :op :mul; :left :n2;  :right :n3.
+:eSub a :Expr; :op :sub; :left :n10; :right :n4.
+:eAdd a :Expr; :op :add; :left :eMul; :right :eSub.
+
+:Root :expr :eAdd.
+
+# ----------------------
+# Backward rules: :value
+# ----------------------
+
+# Base case: numeric node
+{ ?N :value ?V. } <= { ?N :n ?V. }.
+
+# Addition
+{ ?E :value ?V. } <= {
+  ?E :op :add.
+  ?E :left ?L.
+  ?E :right ?R.
+  ?L :value ?LV.
+  ?R :value ?RV.
+  (?LV ?RV) math:sum ?V.
+}.
+
+# Subtraction
+{ ?E :value ?V. } <= {
+  ?E :op :sub.
+  ?E :left ?L.
+  ?E :right ?R.
+  ?L :value ?LV.
+  ?R :value ?RV.
+  (?LV ?RV) math:difference ?V.
+}.
+
+# Multiplication
+{ ?E :value ?V. } <= {
+  ?E :op :mul.
+  ?E :left ?L.
+  ?E :right ?R.
+  ?L :value ?LV.
+  ?R :value ?RV.
+  (?LV ?RV) math:product ?V.
+}.
+
+# ------------------------------
+# Forward rule: emit final value
+# ------------------------------
+
+{ :Root :expr ?E. ?E :value ?V. } => { :Root :result ?V. }.
+

package/examples/family-cousins.n3

@@ -0,0 +1,63 @@
+# --------------
+# Family cousins
+# --------------
+
+@prefix : <http://example.org/family#>.
+@prefix math: <http://www.w3.org/2000/10/swap/math#>.
+
+# --------------------------
+# Data (a small family tree)
+# --------------------------
+
+:Adam  :parentOf :Bob, :Carol .
+:Bob   :parentOf :Dave, :Eve .
+:Carol :parentOf :Frank, :Grace .
+:Dave  :parentOf :Heidi .
+:Eve   :parentOf :Ivan .
+:Frank :parentOf :Judy .
+
+# Seed "branch" labels at generation 2 (so gen-1 siblings won't become cousins)
+:Dave  :branch :b .
+:Eve   :branch :b .
+:Frank :branch :c .
+:Grace :branch :c .
+
+# Declare branch difference (so we can avoid any inequality built-in)
+:b :differentFrom :c .
+:c :differentFrom :b .
+
+# -----------------------------------
+# Rules (generation, branch, cousins)
+# -----------------------------------
+
+# Root generation
+{ } => { :Adam :generation 0 } .
+
+# Generation propagation: child.gen = parent.gen + 1
+{
+  ?P :parentOf ?C .
+  ?P :generation ?G .
+  (?G 1) math:sum ?G1 .
+} => {
+  ?C :generation ?G1 .
+} .
+
+# Branch propagation: child.branch = parent.branch
+{
+  ?P :parentOf ?C .
+  ?P :branch ?B .
+} => {
+  ?C :branch ?B .
+} .
+
+# Cousins: same generation, different branch
+{
+  ?X :generation ?G .
+  ?Y :generation ?G .
+  ?X :branch ?BX .
+  ?Y :branch ?BY .
+  ?BX :differentFrom ?BY .
+} => {
+  ?X :cousin ?Y .
+} .
+

package/examples/gps.n3

@@ -0,0 +1,68 @@
+# ------------------------------
+# Goal driven Parallel Sequences
+# ------------------------------
+#
+# See https://www.sciencedirect.com/science/article/pii/S1532046421000794
+# and https://github.com/hongsun502/wstLogic/tree/master
+
+@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)
+# ---------------------
+
+# 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
+# ----------------
+
+# Base: one edge is a path
+{
+  (?From ?To (?Act) ?Dur ?Cost ?Belief ?Comfort) :path true.
+}
+<=
+{
+  (?From ?To ?Act ?Dur ?Cost ?Belief ?Comfort) :edge true.
+}.
+
+# Recursive: edge + path => path, aggregate weights, concatenate action list
+{
+  (?From ?To ?Acts ?Dur ?Cost ?Belief ?Comfort) :path true.
+}
+<=
+{
+  (?From ?Mid ?Act ?Dur1 ?Cost1 ?Bel1 ?Comf1) :edge true.
+  (?Mid ?To ?RestActs ?Dur2 ?Cost2 ?Bel2 ?Comf2) :path true.
+
+  ((?Act) ?RestActs) list:append ?Acts.
+
+  (?Dur1  ?Dur2)  math:sum     ?Dur.
+  (?Cost1 ?Cost2) math:sum     ?Cost.
+  (?Bel1  ?Bel2)  math:product ?Belief.
+  (?Comf1 ?Comf2) math:product ?Comfort.
+}.
+
+# -------------------------
+# Query: only paths to goal
+# -------------------------
+
+{
+  :i1 :location ?Start.
+  (?Start :Oostende ?Acts ?Dur ?Cost ?Bel ?Comf) :path true.
+}
+=>
+{
+  :i1 gps:path (?Acts ?Dur ?Cost ?Bel ?Comf).
+}.
+

package/examples/light-eaters.n3

@@ -0,0 +1,109 @@
+# ------------
+# Light eaters
+# ------------
+
+@prefix math: <http://www.w3.org/2000/10/swap/math#>.
+@prefix :     <http://example.org/light-eaters#>.
+
+# ------------------------------------------------------------
+# Plants as "light eaters":
+# 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.
+
+# Two habitats with different light intensities (arbitrary units/hour)
+:Meadow :lightIntensity 100.0.
+:Forest :lightIntensity 20.0.
+
+# Organisms
+:Sunflower a :Plant;  :location :Meadow; :chlorophyll true;  :efficiency 0.25; :maintenance 150.0.
+:Fern      a :Plant;  :location :Forest; :chlorophyll true;  :efficiency 0.25; :maintenance 150.0.
+:Mushroom  a :Fungus; :location :Forest; :chlorophyll false; :maintenance 150.0.
+
+# ------------------------------------------------------------
+# Rules
+# ------------------------------------------------------------
+
+# (1) Daily light energy available at each place:
+#     E_place = lightIntensity * lightHours
+{
+  :Today :lightHours ?H.
+  ?Place :lightIntensity ?I.
+  (?I ?H) math:product ?E.
+}
+=>
+{
+  ?Place :dailyLightEnergy ?E.
+}.
+
+# (2) Stored energy for each plant:
+#     stored = E_place * efficiency
+{
+  ?Plant a :Plant.
+  ?Plant :location ?Place.
+  ?Place :dailyLightEnergy ?E.
+  ?Plant :efficiency ?Eff.
+  (?E ?Eff) math:product ?Stored.
+}
+=>
+{
+  ?Plant :storedEnergy ?Stored.
+}.
+
+# (3) Net energy after maintenance:
+#     net = stored - maintenance
+{
+  ?Org :storedEnergy ?Stored.
+  ?Org :maintenance ?Maint.
+  (?Stored ?Maint) math:difference ?Net.
+}
+=>
+{
+  ?Org :netEnergy ?Net.
+}.
+
+# (4) "Light eater" (photosynthesizer) classification:
+#     must be a Plant, must have chlorophyll, and must have positive stored energy
+{
+  ?Plant a :Plant.
+  ?Plant :chlorophyll true.
+  ?Plant :storedEnergy ?Stored.
+  (?Stored 0.0) math:greaterThan true.
+}
+=>
+{
+  ?Plant :canPhotosynthesize true.
+  ?Plant :lightEater true.
+}.
+
+# Non-photosynthesizers (example: fungi)
+{
+  ?X a :Fungus.
+}
+=>
+{
+  ?X :lightEater false.
+}.
+
+# (5) Outcome: thriving vs hungry, based on netEnergy
+{
+  ?Org :netEnergy ?Net.
+  (?Net 0.0) math:greaterThan true.
+}
+=>
+{
+  ?Org :thriving true.
+}.
+
+{
+  ?Org :netEnergy ?Net.
+  (?Net 0.0) math:notGreaterThan true.
+}
+=>
+{
+  ?Org :hungry true.
+}.
+

package/examples/odrl-trust.n3

@@ -0,0 +1,146 @@
+# ----------
+# ODRL trust
+# ----------
+
+@prefix math: <http://www.w3.org/2000/10/swap/math#>.
+@prefix odrl: <http://www.w3.org/ns/odrl/2/>.
+@prefix dct:  <http://purl.org/dc/terms/>.
+@prefix :     <http://example.org/odrl-trust#>.
+
+# ------------------
+# Trust model (0..1)
+# ------------------
+
+:Gov        :trust 0.95.
+:Partner    :trust 0.70.
+:RandomBlog :trust 0.30.
+
+# ---------------------------
+# A request we want to decide
+# ---------------------------
+
+:req1 a :Request;
+  odrl:assignee :Alice;
+  odrl:target   :Doc1;
+  odrl:action   odrl:read.
+
+# -------------
+# ODRL Policies
+# -------------
+
+# High-trust permission from Gov (trusted enough)
+:PolGov a odrl:Policy;
+  dct:creator :Gov;
+  odrl:permission :PermGov.
+
+:PermGov a odrl:Permission;
+  odrl:assignee :Alice;
+  odrl:target   :Doc1;
+  odrl:action   odrl:read;
+  odrl:constraint :CMinGov.
+
+:CMinGov
+  odrl:leftOperand :issuerTrust;
+  odrl:operator    odrl:gteq;
+  odrl:rightOperand 0.80.
+
+# Medium-trust prohibition from Partner (also applies, but lower trust)
+:PolPartner a odrl:Policy;
+  dct:creator :Partner;
+  odrl:prohibition :ProhPartner.
+
+:ProhPartner a odrl:Prohibition;
+  odrl:assignee :Alice;
+  odrl:target   :Doc1;
+  odrl:action   odrl:read;
+  odrl:constraint :CMinPartner.
+
+:CMinPartner
+  odrl:leftOperand :issuerTrust;
+  odrl:operator    odrl:gteq;
+  odrl:rightOperand 0.60.
+
+# Low-trust prohibition from RandomBlog (does NOT apply due to min trust)
+:PolBlog a odrl:Policy;
+  dct:creator :RandomBlog;
+  odrl:prohibition :ProhBlog.
+
+:ProhBlog a odrl:Prohibition;
+  odrl:assignee :Alice;
+  odrl:target   :Doc1;
+  odrl:action   odrl:read;
+  odrl:constraint :CMinBlog.
+
+:CMinBlog
+  odrl:leftOperand :issuerTrust;
+  odrl:operator    odrl:gteq;
+  odrl:rightOperand 0.50.
+
+# --------------------------------
+# Minimal "ODRL + trust" evaluator
+# --------------------------------
+
+# Candidate PERMIT for a request, scored by issuer trust, only if trust >= minTrust
+{
+  (?Req odrl:permit ?Score) :cand true.
+}
+<=
+{
+  ?Req odrl:assignee ?A; odrl:target ?T; odrl:action ?Act.
+
+  ?Pol a odrl:Policy; dct:creator ?Iss; odrl:permission ?Perm.
+  ?Perm odrl:assignee ?A; odrl:target ?T; odrl:action ?Act.
+
+  ?Perm odrl:constraint ?C.
+  ?C odrl:leftOperand :issuerTrust;
+     odrl:operator odrl:gteq;
+     odrl:rightOperand ?Min.
+
+  ?Iss :trust ?Score.
+  (?Score ?Min) math:notLessThan true.
+}.
+
+# Candidate PROHIBIT for a request, scored by issuer trust, only if trust >= minTrust
+{
+  (?Req odrl:prohibit ?Score) :cand true.
+}
+<=
+{
+  ?Req odrl:assignee ?A; odrl:target ?T; odrl:action ?Act.
+
+  ?Pol a odrl:Policy; dct:creator ?Iss; odrl:prohibition ?Proh.
+  ?Proh odrl:assignee ?A; odrl:target ?T; odrl:action ?Act.
+
+  ?Proh odrl:constraint ?C.
+  ?C odrl:leftOperand :issuerTrust;
+     odrl:operator odrl:gteq;
+     odrl:rightOperand ?Min.
+
+  ?Iss :trust ?Score.
+  (?Score ?Min) math:notLessThan true.
+}.
+
+# Decide: permit wins if its score is greater than prohibit score
+{
+  (:req1 odrl:permit ?Sp) :cand true.
+  (:req1 odrl:prohibit ?Sd) :cand true.
+  (?Sp ?Sd) math:greaterThan true.
+}
+=>
+{
+  :req1 :decision odrl:permit.
+  :req1 :confidence ?Sp.
+}.
+
+# Decide: otherwise (tie or prohibit higher), prohibit wins
+{
+  (:req1 odrl:permit ?Sp) :cand true.
+  (:req1 odrl:prohibit ?Sd) :cand true.
+  (?Sd ?Sp) math:notLessThan true.
+}
+=>
+{
+  :req1 :decision odrl:prohibit.
+  :req1 :confidence ?Sd.
+}.
+

package/examples/output/expression-eval.n3

@@ -0,0 +1,23 @@
+@prefix : <http://example.org/expression-eval#> .
+
+# ----------------------------------------------------------------------
+# Proof for derived triple:
+#   :Root :result 12 .
+# It holds because the following instance of the rule body is provable:
+#   :Root :expr :eAdd .
+#   :eAdd :value 12 .
+# via the schematic forward rule:
+#   {
+#     :Root :expr ?E .
+#     ?E :value ?V .
+#   } => {
+#     :Root :result ?V .
+#   } .
+# with substitution (on rule variables):
+#   ?E = :eAdd
+#   ?V = 12
+# Therefore the derived triple above is entailed by the rules and facts.
+# ----------------------------------------------------------------------
+
+:Root :result 12 .
+