eyeling 1.12.7 → 1.12.8

package/HANDBOOK.md

@@ -1972,7 +1972,7 @@ In that sense, N3 is less a bid to make the web “smarter” than a bid to make
 
 ## Appendix C — N3 beyond Prolog: logic for RDF-style graphs
 
-Notation3 (N3) rule sets often look similar to Prolog at the surface: they use variables, unification, and implication-style rules (“if these patterns match, then these patterns follow”). N3 is typically used in a different setting, though: instead of a single program operating over a single local database, N3 rules and data are commonly written as documents that can be published, shared, merged, and referenced across systems.
+Notation3 (N3) rule sets often look similar to Prolog at the surface: they use variables, unification, and implication-style rules (“if these patterns match, then these patterns follow”). N3 is typically used in a different setting: instead of a single program operating over a single local database, N3 rules and data are commonly written as documents that can be published, shared, merged, and referenced across systems.
 
 In practice, that setting is reflected in several common features of N3-style rule writing:
 

package/examples/collatz.n3

@@ -0,0 +1,117 @@
+# ==================
+# Collatz conjecture
+# ==================
+#
+# Collatz iteration:
+#   - if n is even: n ↦ n/2
+#   - if n is odd : n ↦ 3n + 1
+#
+# The conjecture states that starting from any positive integer n,
+# repeated application of the rule eventually reaches 1.
+#
+# This N3 program:
+#   1) enumerates test inputs N = 1000, 999, ..., 1 via a backward :repeat relation
+#   2) computes the full Collatz trajectory for each N as an RDF list
+#   3) materializes only the final results as  :collatzTrajectory  triples
+#
+# See https://en.wikipedia.org/wiki/Collatz_conjecture
+
+@prefix :     <http://example.org/collatz#> .
+@prefix math: <http://www.w3.org/2000/10/swap/math#> .
+@prefix list: <http://www.w3.org/2000/10/swap/list#> .
+
+# -----------------------------------------
+# Query / materialization of the test suite
+# -----------------------------------------
+#
+# Generate N in {1000..1} and ask the backward-defined :collatz predicate
+# for the full trajectory list ?M.
+#
+# Note: we derive N as (1000 - N0) so that N0 ranges over 0..999.
+# This keeps :repeat as a generic “0..N-1” generator.
+#
+# Output predicate is renamed to :collatzTrajectory to keep results separate
+# from the intensional (backward) definition of :collatz.
+{
+  1000 :repeat ?N0 .
+  (1000 ?N0) math:difference ?N .
+  ?N :collatz ?M .
+}
+=>
+{
+  ?N :collatzTrajectory ?M .
+} .
+
+# ------------------------
+# Backward range generator
+# ------------------------
+#
+# ?N :repeat ?I  enumerates all integers I in the half-open interval:
+#   I ∈ [0 .. N-1]
+
+# Base case: repeat(1) = {0}
+{ ?N :repeat 0 }
+<=
+{ ?N math:equalTo 1. } .
+
+# For N>1, also include the last value (N-1)
+{ ?N :repeat ?I }
+<=
+{
+  ?N math:greaterThan 1.
+  (?N 1) math:difference ?I.     # I = N - 1
+} .
+
+# And for N>1, inherit everything from repeat(N-1)
+# (this is the recursive “rest of the range”)
+{ ?N :repeat ?I }
+<=
+{
+  ?N math:greaterThan 1.
+  (?N 1) math:difference ?N1.    # N1 = N - 1
+  ?N1 :repeat ?I.
+} .
+
+# -------------------------
+# Backward Collatz relation
+# -------------------------
+#
+# ?N0 :collatz ?M  relates a start value ?N0 to its full Collatz trajectory ?M.
+# The trajectory is represented as an RDF list:
+#   - for N0=1: (1)
+#   - for N0>1: (N0 ... 1)
+#
+# The recursion is guarded with “N0 > 1” so the base case terminates cleanly.
+
+# Base case: 1 terminates immediately
+{ ?N0 :collatz (1) }
+<=
+{ ?N0 math:equalTo 1. } .
+
+# Even step: N0 > 1 and N0 mod 2 = 0  =>  N1 = N0/2
+# The resulting list is constructed as: (N0) :: collatz(N1)
+{ ?N0 :collatz ?M }
+<=
+{
+  ?N0 math:greaterThan 1.
+  (?N0 2) math:remainder 0.
+  (?N0 2) math:integerQuotient ?N1.   # N1 = floor(N0/2) (safe because even)
+
+  ?N1 :collatz ?J.
+  ?M list:firstRest (?N0 ?J).         # M = [N0 | J]
+} .
+
+# Odd step: N0 > 1 and N0 mod 2 = 1  =>  N1 = 3*N0 + 1
+# Again: (N0) :: collatz(N1)
+{ ?N0 :collatz ?M }
+<=
+{
+  ?N0 math:greaterThan 1.
+  (?N0 2) math:remainder 1.
+  (3 ?N0) math:product ?T.
+  (?T 1) math:sum ?N1.                # N1 = 3*N0 + 1
+
+  ?N1 :collatz ?J.
+  ?M list:firstRest (?N0 ?J).         # M = [N0 | J]
+} .
+

package/examples/digital-product-passport.n3

@@ -0,0 +1,316 @@
+# ==============================
+# Digital Product Passport (DPP)
+# ==============================
+#
+# This file mixes:
+#   (A) DPP "facts" (the passport itself)
+#   (B) A few N3 rules that derive computed indicators and a summary string
+#
+# Units
+#   - Mass is in grams (integers)
+#   - Footprint values are in gCO2e (integers)
+
+@prefix :       <http://example.org/dpp#> .
+@prefix xsd:    <http://www.w3.org/2001/XMLSchema#> .
+@prefix math:   <http://www.w3.org/2000/10/swap/math#> .
+@prefix list:   <http://www.w3.org/2000/10/swap/list#> .
+@prefix log:    <http://www.w3.org/2000/10/swap/log#> .
+@prefix string: <http://www.w3.org/2000/10/swap/string#> .
+
+# --------------------
+# 1) Actors and places
+# --------------------
+
+:AcmeElectronics
+  a :Organization;
+  :legalName "Acme Electronics NV";
+  :vatId "BE0123456789";
+  :country "BE".
+
+:FactoryBE01
+  a :Site;
+  :siteName "Acme Assembly Plant BE-01";
+  :country "BE".
+
+:RepairShop1
+  a :Organization;
+  :legalName "FixFast Repairs";
+  :country "BE".
+
+# --------------------------
+# 2) Product + Passport root
+# --------------------------
+
+:Passport-ACME-X1000-SN123
+  a :DigitalProductPassport;
+  :describesProduct :ACME-X1000-SN123;
+  :passportVersion "1.0";
+  :issuedAt "2026-02-10"^^xsd:date;
+  :publicEndpoint <https://example.org/dpp/ACME-X1000-SN123>;
+  :accessPolicy :Policy-ACME-DPP.
+
+:Policy-ACME-DPP
+  a :AccessPolicy;
+  :hasSection :Section-Public, :Section-Restricted.
+
+:Section-Public
+  a :PassportSection;
+  :accessLevel :public.
+
+:Section-Restricted
+  a :PassportSection;
+  :accessLevel :restricted;
+  :intendedAudience "authorities, auditors, service partners".
+
+# ----------------------------------
+# 3) Product identity & traceability
+# ----------------------------------
+
+:ACME-X1000-SN123
+  a :ProductInstance;
+  :model "ACME X1000";
+  :serialNumber "SN123";
+  :batchId "BATCH-2026-01";
+  :madeBy :AcmeElectronics;
+  :madeAtSite :FactoryBE01;
+  :manufactureDate "2026-01-15"^^xsd:date;
+  :category :Smartphone;
+  :dpp :Passport-ACME-X1000-SN123;
+  :digitalLink "https://example.org/dpp/ACME-X1000-SN123".
+
+# ------------------------------
+# 4) Composition (bill of parts)
+# ------------------------------
+
+:ACME-X1000-SN123
+  :hasComponent :BatteryPack-01, :Chassis-01, :Mainboard-01;
+  :componentList ( :BatteryPack-01 :Chassis-01 :Mainboard-01 ).
+
+:BatteryPack-01
+  a :Component;
+  :componentType :Battery;
+  :massG 48;
+  :recycledMassG 0;
+  :replaceable true;
+  :containsMaterial :Lithium, :Cobalt, :Nickel.
+
+:Chassis-01
+  a :Component;
+  :componentType :Housing;
+  :massG 32;
+  :recycledMassG 12;
+  :containsMaterial :Aluminium.
+
+:Mainboard-01
+  a :Component;
+  :componentType :Electronics;
+  :massG 25;
+  :recycledMassG 2;
+  :containsMaterial :Copper, :GoldTrace.
+
+# Materials (toy taxonomy)
+:Lithium    a :Material; :criticalRawMaterial true.
+:Cobalt     a :Material; :criticalRawMaterial true.
+:Nickel     a :Material; :criticalRawMaterial false.
+:Aluminium  a :Material; :criticalRawMaterial false.
+:Copper     a :Material; :criticalRawMaterial false.
+:GoldTrace  a :Material; :criticalRawMaterial false.
+
+# -----------------------------------------------------
+# 5) Documents / claims (public vs restricted sections)
+# -----------------------------------------------------
+
+:Passport-ACME-X1000-SN123
+  :inSection :Section-Public;
+  :hasDocument :Doc-UserManual, :Doc-RepairGuide, :Doc-SpareParts.
+
+:Doc-UserManual
+  a :Document;
+  :docType :UserManual;
+  :url <https://example.org/docs/acme-x1000/user-manual.pdf>.
+
+:Doc-RepairGuide
+  a :Document;
+  :docType :RepairGuide;
+  :url <https://example.org/docs/acme-x1000/repair-guide.pdf>;
+  :declares :BatteryReplacementSupported.
+
+:BatteryReplacementSupported
+  a :Claim;
+  :claimText "Battery is user-replaceable with standard tools.".
+
+:Doc-SpareParts
+  a :Document;
+  :docType :SparePartsCatalog;
+  :url <https://example.org/spares/acme-x1000>.
+
+:Passport-ACME-X1000-SN123
+  :inSection :Section-Restricted;
+  :hasDocument :Doc-DoC-CE, :Doc-SubstanceDeclaration.
+
+:Doc-DoC-CE
+  a :Document;
+  :docType :DeclarationOfConformity;
+  :url <https://example.org/docs/acme-x1000/ce-doc.pdf>.
+
+:Doc-SubstanceDeclaration
+  a :Document;
+  :docType :SubstanceDeclaration;
+  :url <https://example.org/docs/acme-x1000/substances.json>.
+
+# --------------------------------
+# 6) Lifecycle events (provenance)
+# --------------------------------
+
+:Event-Mfg-01
+  a :ManufacturingEvent;
+  :forProduct :ACME-X1000-SN123;
+  :performedBy :AcmeElectronics;
+  :atSite :FactoryBE01;
+  :onDate "2026-01-15"^^xsd:date.
+
+:Event-Sale-01
+  a :SaleEvent;
+  :forProduct :ACME-X1000-SN123;
+  :onDate "2026-01-25"^^xsd:date;
+  :country "BE".
+
+:Event-Repair-01
+  a :RepairEvent;
+  :forProduct :ACME-X1000-SN123;
+  :performedBy :RepairShop1;
+  :onDate "2026-02-05"^^xsd:date;
+  :replacedComponent :BatteryPack-01;
+  :inSection :Section-Restricted.
+
+# ---------------------------------
+# 7) Environmental footprint inputs
+# ---------------------------------
+
+:ACME-X1000-SN123
+  :mfgFootprint_gCO2e 32000;
+  :transportFootprint_gCO2e 2500;
+  :usePhaseFootprint_gCO2e 18000.
+
+# ------------------------------------------
+# 8) Rules: derive indicators + summary line
+# ------------------------------------------
+
+# 8.1 Fold over the explicit component list to compute total mass and recycled mass.
+#
+# List-level totals are attached to the list node itself:
+#   ?L :sumMassG ?m.
+#   ?L :sumRecycledG ?r.
+#
+# Then we attach them to the product that owns the list.
+
+# Empty list totals
+{ () :sumMassG 0. } <= { true. } .
+{ () :sumRecycledG 0. } <= { true. } .
+
+# Non-empty list: sum(list) = head + sum(tail)
+{ ?L :sumMassG ?mTot. }
+<=
+{
+  ?L list:firstRest (?C ?Rest).
+
+  ?C :massG ?m.
+
+  ?Rest :sumMassG ?mRest.
+  (?m ?mRest) math:sum ?mTot.
+} .
+
+{ ?L :sumRecycledG ?rTot. }
+<=
+{
+  ?L list:firstRest (?C ?Rest).
+
+  ?C :recycledMassG ?r.
+
+  ?Rest :sumRecycledG ?rRest.
+  (?r ?rRest) math:sum ?rTot.
+} .
+
+# Attach totals to the product
+{
+  ?P :componentList ?L.
+  ?L :sumMassG ?mTot.
+  ?L :sumRecycledG ?rTot.
+}
+=>
+{
+  ?P :totalMassG ?mTot.
+  ?P :recycledMassG ?rTot.
+} .
+
+# 8.2 Recycled content percentage (integer % floor)
+# pct = floor( recycledMassG * 100 / totalMassG )
+{
+  ?P :totalMassG ?mTot.
+  ?P :recycledMassG ?rTot.
+  (?rTot 100) math:product ?r100.
+  (?r100 ?mTot) math:integerQuotient ?pct.
+}
+=>
+{
+  ?P :recycledContentPct ?pct.
+} .
+
+# 8.3 Lifecycle footprint total (gCO2e)
+{
+  ?P :mfgFootprint_gCO2e ?a.
+  ?P :transportFootprint_gCO2e ?b.
+  ?P :usePhaseFootprint_gCO2e ?c.
+  (?a ?b) math:sum ?ab.
+  (?ab ?c) math:sum ?tot.
+}
+=>
+{
+  ?P :lifecycleFootprint_gCO2e ?tot.
+} .
+
+# 8.4 Simple "circularity hint": battery replaceable + spare parts catalog exists
+{
+  ?P :hasComponent ?B.
+  ?B :componentType :Battery.
+  ?B :replaceable true.
+
+  ?Passport :describesProduct ?P.
+  ?Passport :hasDocument ?Doc.
+  ?Doc :docType :SparePartsCatalog.
+}
+=>
+{
+  ?P :circularityHint :repairFriendly.
+} .
+
+# 8.5 Flag: contains a critical raw material
+{
+  ?P :hasComponent ?C.
+  ?C :containsMaterial ?M.
+  ?M :criticalRawMaterial true.
+}
+=>
+{
+  ?P :containsCriticalRawMaterial true.
+} .
+
+# 8.6 Optional compact summary line (one per product)
+#
+# Example:
+#   ACME X1000 SN123 | recycled=13% | lifecycle=52500 gCO2e | CRM=true | hint=repairFriendly
+{
+  ?P :model ?model.
+  ?P :serialNumber ?sn.
+  ?P :recycledContentPct ?pct.
+  ?P :lifecycleFootprint_gCO2e ?co2.
+  ?P :containsCriticalRawMaterial ?crm.
+  ?P :circularityHint ?hint.
+
+  ("%s %s | recycled=%s%% | lifecycle=%s gCO2e | CRM=%s | hint=%s\n"
+    ?model ?sn ?pct ?co2 ?crm ?hint) string:format ?line.
+}
+=>
+{
+  ?P log:outputString ?line.
+} .

package/examples/godel-incompleteness.n3

@@ -0,0 +1,107 @@
+# ===================================================================================
+# A tiny RDF(+rules) knowledge base about:
+# "Incompleteness: The Proof and Paradox of Kurt Gödel" — Rebecca Newberger Goldstein
+# ===================================================================================
+
+@prefix ex:     <http://example.org/incompleteness/> .
+@prefix schema: <http://schema.org/> .
+@prefix dct:    <http://purl.org/dc/terms/> .
+@prefix bibo:   <http://purl.org/ontology/bibo/> .
+@prefix foaf:   <http://xmlns.com/foaf/0.1/> .
+@prefix skos:   <http://www.w3.org/2004/02/skos/core#> .
+@prefix xsd:    <http://www.w3.org/2001/XMLSchema#> .
+
+# -----
+# Facts
+# -----
+
+ex:book2005
+  a schema:Book, bibo:Book ;
+  dct:title "Incompleteness: The Proof and Paradox of Kurt Gödel"@en ;
+  schema:name "Incompleteness: The Proof and Paradox of Kurt Gödel"@en ;
+  schema:author ex:rebeccaGoldstein ;
+  schema:publisher ex:wwNorton ;
+  dct:issued "2005"^^xsd:gYear ;
+  schema:inLanguage "en" ;
+  schema:numberOfPages 296 ;
+  bibo:isbn10 "0393051692" ;
+  bibo:isbn13 "9780393051698" ;
+  bibo:oclcnum "860568768" ;
+  schema:about ex:kurtGodel,
+               ex:godelIncompletenessTheorems,
+               ex:hilbertsProgram,
+               ex:platonismInMath ;
+  schema:genre "biography", "mathematics", "philosophy of mathematics" ;
+  schema:description
+    "A biographical and intellectual portrait of Gödel, explaining the incompleteness theorems and their philosophical context."@en .
+
+ex:rebeccaGoldstein
+  a foaf:Person, schema:Person ;
+  foaf:name "Rebecca Newberger Goldstein" .
+
+ex:kurtGodel
+  a foaf:Person, schema:Person ;
+  foaf:name "Kurt Gödel" .
+
+ex:wwNorton
+  a schema:Organization ;
+  schema:name "W. W. Norton & Company" ;
+  schema:location "New York" .
+
+# ----------------------------
+# Topic concepts (simple SKOS)
+# ----------------------------
+
+ex:godelIncompletenessTheorems
+  a skos:Concept ;
+  skos:prefLabel "Gödel's incompleteness theorems"@en ;
+  skos:broader ex:mathematicalLogic .
+
+ex:hilbertsProgram
+  a skos:Concept ;
+  skos:prefLabel "Hilbert's program"@en ;
+  skos:broader ex:foundationsOfMathematics .
+
+ex:platonismInMath
+  a skos:Concept ;
+  skos:prefLabel "Platonism in mathematics"@en ;
+  skos:broader ex:philosophyOfMathematics .
+
+ex:mathematicalLogic
+  a skos:Concept ;
+  skos:prefLabel "Mathematical logic"@en .
+
+ex:foundationsOfMathematics
+  a skos:Concept ;
+  skos:prefLabel "Foundations of mathematics"@en .
+
+ex:philosophyOfMathematics
+  a skos:Concept ;
+  skos:prefLabel "Philosophy of mathematics"@en .
+
+# -----------------------
+# Rules (N3 implications)
+# -----------------------
+
+# 1) Invert author → made
+{ ?book schema:author ?person . }
+  => { ?person foaf:made ?book . } .
+
+# 2) If a book is about a person, infer reverse subjectOf
+{ ?book schema:about ?person .
+  ?person a foaf:Person . }
+  => { ?person schema:subjectOf ?book . } .
+
+# 3) If it’s about incompleteness theorems, tag it as mathematical logic
+{ ?book schema:about ex:godelIncompletenessTheorems . }
+  => { ?book dct:subject ex:mathematicalLogic . } .
+
+# 4) Tiny “recommendation” rule (demo of deriving new facts)
+{ ?book dct:subject ex:mathematicalLogic ;
+        schema:inLanguage "en" . }
+  => { ?book ex:recommendedFor ex:logicLearnerEn . } .
+
+ex:logicLearnerEn
+  a skos:Concept ;
+  skos:prefLabel "English-reading logic learner"@en .
+

package/examples/goldbach.n3

@@ -0,0 +1,117 @@
+# ======================================
+# Goldbach conjecture (bounded checker)
+# ======================================
+# Strong (even) Goldbach:
+#   Every even integer E > 2 can be written as E = P + Q with P,Q prime.
+#
+# Performance notes (Eyeling):
+#   - Avoid forward "successor" rules that generate 0..N step-by-step across many
+#     saturation passes. Eyeling re-runs forward rules until fixpoint.
+#   - Use a backward range predicate (:repeat) so enumeration happens inside one
+#     backward proof search.
+#   - Cache primes as facts (:isPrime true) once; then Goldbach checking is cheap.
+
+@prefix :      <http://example.org/goldbach#> .
+@prefix math:  <http://www.w3.org/2000/10/swap/math#> .
+@prefix log:   <http://www.w3.org/2000/10/swap/log#> .
+@prefix string:<http://www.w3.org/2000/10/swap/string#> .
+
+:cfg :maxEven 1000 .
+
+# -------------------------------------------------
+# Backward range: ?N :repeat ?I gives I in [0..N-1]
+# -------------------------------------------------
+
+{ ?N :repeat 0 }
+<=
+{ ?N math:equalTo 1 } .
+
+{ ?N :repeat ?I }
+<=
+{
+  ?N math:greaterThan 1.
+  (?N 1) math:difference ?N1.
+  ?N1 :repeat ?I.
+} .
+
+{ ?N :repeat ?I }
+<=
+{
+  ?N math:greaterThan 1.
+  (?N 1) math:difference ?I.
+} .
+
+# --------------------------------------------
+# Backward primality (trial division by odd D)
+# --------------------------------------------
+
+{ 2 :prime true } <= { true } .
+
+{ ?N :prime true }
+<=
+{
+  ?N math:greaterThan 2.
+  (?N 2) math:remainder 1.
+  (?N 3) :primeTrial true.
+} .
+
+{ (?N ?D) :primeTrial true }
+<=
+{
+  (?D ?D) math:product ?DD.
+  ?DD math:greaterThan ?N.
+} .
+
+{ (?N ?D) :primeTrial true }
+<=
+{
+  (?D ?D) math:product ?DD.
+  ?DD math:notGreaterThan ?N.
+
+  (?N ?D) math:remainder ?R.
+  ?R math:notEqualTo 0.
+
+  (?D 2) math:sum ?D2.
+  (?N ?D2) :primeTrial true.
+} .
+
+# ------------------------------------------------------
+# 1) Cache primes up to maxEven (enumerated via :repeat)
+# ------------------------------------------------------
+
+{
+  :cfg :maxEven ?Max.
+  (?Max 1) math:difference ?R.     # R = Max-1
+  ?R :repeat ?I.                   # I in [0..Max-2]
+  (?I 2) math:sum ?N.              # N in [2..Max]
+  ?N :prime true.
+}
+=>
+{
+  ?N :isPrime true.
+} .
+
+# ---------------------------------------------
+# 2) Goldbach OK for all even E in [4..maxEven]
+#    Enumerate E by K in [2..Max/2] then E=2*K
+# ---------------------------------------------
+
+{
+  :cfg :maxEven ?Max.
+  (?Max 2) math:integerQuotient ?MaxK.   # MaxK = Max/2
+  (?MaxK 1) math:difference ?RK.         # RK = MaxK-1
+  ?RK :repeat ?I.                        # I in [0..MaxK-2]
+  (?I 2) math:sum ?K.                    # K in [2..MaxK]
+  (?K 2) math:product ?E.                # E = 2*K (even, >=4)
+
+  (?E 2) math:integerQuotient ?Half.     # Half = E/2
+  ?P :isPrime true.
+  ?P math:notGreaterThan ?Half.
+  (?E ?P) math:difference ?Q.
+  ?Q :isPrime true.
+}
+=>
+{
+  ?E :goldbachOk true.
+} .
+