eyeling 1.5.42 → 1.6.0

package/examples/ruby-runge-workshop.n3

@@ -0,0 +1,256 @@
+# ================================================================
+# Heavy-Math N3 Demo: "Ruby Runge Workshop"
+# ------------------------------------------------
+# A math-stress N3 ruleset for polynomial interpolation (Lagrange form),
+# plus numerical differentiation and a simple root search check.
+#
+# What it does:
+#  1) Given a set of (x_i, y_i) points, computes Lagrange basis weights
+#     at a query x0 and outputs interpolated y(x0):
+#
+#       y(x0) = Σ_i y_i * Π_{j≠i} (x0 - x_j)/(x_i - x_j)
+#
+#     This exercises lots of nested products/quotients and list collection.
+#
+#  2) Estimates derivative at x0 by symmetric difference:
+#       y'(x0) ≈ (y(x0+h) - y(x0-h)) / (2h)
+#
+#  3) Flags if y(x0) crosses zero between two bracketing x-values
+#     (a basic “root bracket” detector).
+#
+# Notes:
+#  - Uses only: math:, list:, log:
+#  - Designed as a strict-datatype regression workload.
+# ================================================================
+
+@prefix :     <http://example.org/ruby-runge#> .
+@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#> .
+
+############
+# DATA
+############
+
+:Interp1
+  :points (
+    [ :id 1 ; :x -2.0 ; :y  7.0  ]
+    [ :id 2 ; :x -1.0 ; :y  1.0  ]
+    [ :id 3 ; :x  0.0 ; :y -1.0  ]
+    [ :id 4 ; :x  1.0 ; :y  1.0  ]
+    [ :id 5 ; :x  2.0 ; :y  7.0  ]
+  ) ;
+  :x0 0.6 ;
+  :h  0.001 ;
+  :bracketA 0.0 ;
+  :bracketB 1.0 .
+
+############
+# Helper: compute product of a collected list
+# (We just use math:productPairwise by folding: collectAll + math:product works
+# in many engines, but to stay portable we explicitly fold with list:member.)
+# We'll implement "sum of products" directly without defining new builtins.
+############
+
+############
+# (1) LAGRANGE INTERPOLATION y(x0)
+############
+
+{
+  :Interp1 :points ?pts ; :x0 ?x0 .
+
+  # Collect each term_i = y_i * basis_i(x0)
+  ( ?term {
+      ?pts list:member ?pi .
+      ?pi :x ?xi ; :y ?yi .
+
+      # Collect factors f_ij = (x0 - xj)/(xi - xj) for all j != i
+      ( ?f {
+          ?pts list:member ?pj .
+          ?pj :x ?xj .
+          ?xj math:notEqualTo ?xi .
+
+          (?x0 ?xj) math:difference ?num .
+          (?xi ?xj) math:difference ?den .
+          (?num ?den) math:quotient ?f .
+        } ?factors
+      ) log:collectAllIn _:lag1 .
+
+      # Multiply all factors in ?factors to get basis_i
+      # basis = Π f
+      # We'll do it by collecting logs, but simplest is:
+      ?factors math:product ?basis .
+
+      (?yi ?basis) math:product ?term .
+    } ?terms
+  ) log:collectAllIn _:lag0 .
+
+  # y0 = Σ term_i
+  ?terms math:sum ?y0 .
+}
+=>
+{
+  :Interp1 :yAtX0 ?y0 .
+} .
+
+############
+# (2) SYMMETRIC DIFFERENCE DERIVATIVE
+# y'(x0) ≈ (y(x0+h) - y(x0-h)) / (2h)
+#
+# We compute yPlus and yMinus using the same Lagrange mechanism.
+############
+
+# y(x0+h)
+{
+  :Interp1 :points ?pts ; :x0 ?x0 ; :h ?h .
+  (?x0 ?h) math:sum ?xPlus .
+
+  ( ?term {
+      ?pts list:member ?pi .
+      ?pi :x ?xi ; :y ?yi .
+
+      ( ?f {
+          ?pts list:member ?pj .
+          ?pj :x ?xj .
+          ?xj math:notEqualTo ?xi .
+          (?xPlus ?xj) math:difference ?num .
+          (?xi ?xj) math:difference ?den .
+          (?num ?den) math:quotient ?f .
+        } ?factors
+      ) log:collectAllIn _:d1 .
+      ?factors math:product ?basis .
+      (?yi ?basis) math:product ?term .
+    } ?terms
+  ) log:collectAllIn _:d0 .
+  ?terms math:sum ?yPlus .
+}
+=>
+{
+  :Interp1 :yAtXPlus ?yPlus ;
+           :xPlus ?xPlus .
+} .
+
+# y(x0-h)
+{
+  :Interp1 :points ?pts ; :x0 ?x0 ; :h ?h .
+  (?x0 ?h) math:difference ?xMinus .
+
+  ( ?term {
+      ?pts list:member ?pi .
+      ?pi :x ?xi ; :y ?yi .
+
+      ( ?f {
+          ?pts list:member ?pj .
+          ?pj :x ?xj .
+          ?xj math:notEqualTo ?xi .
+          (?xMinus ?xj) math:difference ?num .
+          (?xi ?xj) math:difference ?den .
+          (?num ?den) math:quotient ?f .
+        } ?factors
+      ) log:collectAllIn _:e1 .
+      ?factors math:product ?basis .
+      (?yi ?basis) math:product ?term .
+    } ?terms
+  ) log:collectAllIn _:e0 .
+  ?terms math:sum ?yMinus .
+}
+=>
+{
+  :Interp1 :yAtXMinus ?yMinus ;
+           :xMinus ?xMinus .
+} .
+
+# derivative from yPlus, yMinus
+{
+  :Interp1 :yAtXPlus ?yP ; :yAtXMinus ?yM ; :h ?h .
+  (?yP ?yM) math:difference ?dy .
+  (2.0 ?h) math:product ?twoH .
+  (?dy ?twoH) math:quotient ?dydx .
+}
+=>
+{
+  :Interp1 :derivativeAtX0 ?dydx .
+} .
+
+############
+# (3) ROOT BRACKET CHECK between bracketA and bracketB
+# If y(a) and y(b) have opposite signs, mark a bracket.
+#
+# We compute y(a) and y(b) by interpolation too (same points set).
+############
+
+# y at bracketA
+{
+  :Interp1 :points ?pts ; :bracketA ?xa .
+
+  ( ?term {
+      ?pts list:member ?pi .
+      ?pi :x ?xi ; :y ?yi .
+
+      ( ?f {
+          ?pts list:member ?pj .
+          ?pj :x ?xj .
+          ?xj math:notEqualTo ?xi .
+          (?xa ?xj) math:difference ?num .
+          (?xi ?xj) math:difference ?den .
+          (?num ?den) math:quotient ?f .
+        } ?factors
+      ) log:collectAllIn _:ra1 .
+      ?factors math:product ?basis .
+      (?yi ?basis) math:product ?term .
+    } ?terms
+  ) log:collectAllIn _:ra0 .
+  ?terms math:sum ?ya .
+}
+=>
+{
+  :Interp1 :yAtBracketA ?ya .
+} .
+
+# y at bracketB
+{
+  :Interp1 :points ?pts ; :bracketB ?xb .
+
+  ( ?term {
+      ?pts list:member ?pi .
+      ?pi :x ?xi ; :y ?yi .
+
+      ( ?f {
+          ?pts list:member ?pj .
+          ?pj :x ?xj .
+          ?xj math:notEqualTo ?xi .
+          (?xb ?xj) math:difference ?num .
+          (?xi ?xj) math:difference ?den .
+          (?num ?den) math:quotient ?f .
+        } ?factors
+      ) log:collectAllIn _:rb1 .
+      ?factors math:product ?basis .
+      (?yi ?basis) math:product ?term .
+    } ?terms
+  ) log:collectAllIn _:rb0 .
+  ?terms math:sum ?yb .
+}
+=>
+{
+  :Interp1 :yAtBracketB ?yb .
+} .
+
+# bracket detection via sign test: ya*yb < 0
+{
+  :Interp1 :bracketA ?xa ; :bracketB ?xb ;
+           :yAtBracketA ?ya ; :yAtBracketB ?yb .
+  (?ya ?yb) math:product ?prod .
+  ?prod math:lessThan 0.0 .
+}
+=>
+{
+  :Interp1 :rootBracket [ :a ?xa ; :b ?xb ; :ya ?ya ; :yb ?yb ] .
+} .
+
+############
+# STRICTNESS REGRESSION HOOK (should fail in strict math)
+############
+# {
+#   "0.6"^^<http://example.org/not-a-number> math:sum 1.0 .
+# } => { :bad :datatype :accepted . } .
+

package/examples/topaz-markov-mill.n3

@@ -0,0 +1,260 @@
+# ================================================================
+# Heavy-Math N3 Demo: "Topaz Markov Mill (No-Log Edition)"
+# ------------------------------------------------
+# Markov chain workload that stays inside the W3C N3 math builtins.
+#
+# What it does:
+#  1) Validates row-stochasticity (row sums = 1)
+#  2) Propagates π0 -> π1 -> π2 -> π3
+#  3) Computes P^2 row for A (extra matrix workload)
+#  4) For each πt, computes:
+#     - sumSq = Σ p_i^2
+#     - gini  = 1 - sumSq
+#     - effN  = 1 / sumSq     (effective number of states)
+#     - TV    = 0.5 * Σ |p_i - 1/3|
+#     - L2    = sqrt( Σ (p_i - 1/3)^2 )
+#
+# Builtins used: math:, list:
+# ================================================================
+
+@prefix :     <http://example.org/topaz-markov#> .
+@prefix math: <http://www.w3.org/2000/10/swap/math#> .
+@prefix list: <http://www.w3.org/2000/10/swap/list#> .
+
+############
+# DATA
+############
+
+:MC1
+  :states ( :A :B :C ) ;
+
+  # Transition matrix P, encoded as explicit row nodes
+  :row [ :from :A ; :pA 0.80 ; :pB 0.15 ; :pC 0.05 ] ;
+  :row [ :from :B ; :pA 0.10 ; :pB 0.70 ; :pC 0.20 ] ;
+  :row [ :from :C ; :pA 0.25 ; :pB 0.25 ; :pC 0.50 ] ;
+
+  # Initial distribution π0 over (A,B,C)
+  :pi0 [ :pA 0.60 ; :pB 0.30 ; :pC 0.10 ] .
+
+############
+# (1) ROW-STOCHASTIC CHECK: pA+pB+pC = 1.0
+############
+
+{
+  :MC1 :row ?r .
+  ?r :pA ?a ; :pB ?b ; :pC ?c .
+  (?a ?b) math:sum ?ab .
+  (?ab ?c) math:sum ?sum .
+  ?sum math:equalTo 1.0 .
+}
+=>
+{
+  :MC1 :rowOk ?r .
+} .
+
+############
+# (2) ONE-STEP PROPAGATION (explicit for π0->π1, π1->π2, π2->π3)
+############
+
+# π1 = π0 P
+{
+  :MC1 :pi0 ?pi .
+  :MC1 :row ?rA . ?rA :from :A ; :pA ?AA ; :pB ?AB ; :pC ?AC .
+  :MC1 :row ?rB . ?rB :from :B ; :pA ?BA ; :pB ?BB ; :pC ?BC .
+  :MC1 :row ?rC . ?rC :from :C ; :pA ?CA ; :pB ?CB ; :pC ?CC .
+
+  ?pi :pA ?pA ; :pB ?pB ; :pC ?pC .
+
+  # π1A
+  (?pA ?AA) math:product ?tAA .
+  (?pB ?BA) math:product ?tBA .
+  (?pC ?CA) math:product ?tCA .
+  (?tAA ?tBA) math:sum ?s1 .
+  (?s1  ?tCA) math:sum ?pi1A .
+
+  # π1B
+  (?pA ?AB) math:product ?tAB .
+  (?pB ?BB) math:product ?tBB .
+  (?pC ?CB) math:product ?tCB .
+  (?tAB ?tBB) math:sum ?s2 .
+  (?s2  ?tCB) math:sum ?pi1B .
+
+  # π1C
+  (?pA ?AC) math:product ?tAC .
+  (?pB ?BC) math:product ?tBC .
+  (?pC ?CC) math:product ?tCC .
+  (?tAC ?tBC) math:sum ?s3 .
+  (?s3  ?tCC) math:sum ?pi1C .
+}
+=>
+{
+  :MC1 :pi1 [ :pA ?pi1A ; :pB ?pi1B ; :pC ?pi1C ] .
+} .
+
+# π2 = π1 P
+{
+  :MC1 :pi1 ?pi .
+  :MC1 :row ?rA . ?rA :from :A ; :pA ?AA ; :pB ?AB ; :pC ?AC .
+  :MC1 :row ?rB . ?rB :from :B ; :pA ?BA ; :pB ?BB ; :pC ?BC .
+  :MC1 :row ?rC . ?rC :from :C ; :pA ?CA ; :pB ?CB ; :pC ?CC .
+
+  ?pi :pA ?pA ; :pB ?pB ; :pC ?pC .
+
+  (?pA ?AA) math:product ?tAA .
+  (?pB ?BA) math:product ?tBA .
+  (?pC ?CA) math:product ?tCA .
+  (?tAA ?tBA) math:sum ?s1 .
+  (?s1  ?tCA) math:sum ?pi2A .
+
+  (?pA ?AB) math:product ?tAB .
+  (?pB ?BB) math:product ?tBB .
+  (?pC ?CB) math:product ?tCB .
+  (?tAB ?tBB) math:sum ?s2 .
+  (?s2  ?tCB) math:sum ?pi2B .
+
+  (?pA ?AC) math:product ?tAC .
+  (?pB ?BC) math:product ?tBC .
+  (?pC ?CC) math:product ?tCC .
+  (?tAC ?tBC) math:sum ?s3 .
+  (?s3  ?tCC) math:sum ?pi2C .
+}
+=>
+{
+  :MC1 :pi2 [ :pA ?pi2A ; :pB ?pi2B ; :pC ?pi2C ] .
+} .
+
+# π3 = π2 P
+{
+  :MC1 :pi2 ?pi .
+  :MC1 :row ?rA . ?rA :from :A ; :pA ?AA ; :pB ?AB ; :pC ?AC .
+  :MC1 :row ?rB . ?rB :from :B ; :pA ?BA ; :pB ?BB ; :pC ?BC .
+  :MC1 :row ?rC . ?rC :from :C ; :pA ?CA ; :pB ?CB ; :pC ?CC .
+
+  ?pi :pA ?pA ; :pB ?pB ; :pC ?pC .
+
+  (?pA ?AA) math:product ?tAA .
+  (?pB ?BA) math:product ?tBA .
+  (?pC ?CA) math:product ?tCA .
+  (?tAA ?tBA) math:sum ?s1 .
+  (?s1  ?tCA) math:sum ?pi3A .
+
+  (?pA ?AB) math:product ?tAB .
+  (?pB ?BB) math:product ?tBB .
+  (?pC ?CB) math:product ?tCB .
+  (?tAB ?tBB) math:sum ?s2 .
+  (?s2  ?tCB) math:sum ?pi3B .
+
+  (?pA ?AC) math:product ?tAC .
+  (?pB ?BC) math:product ?tBC .
+  (?pC ?CC) math:product ?tCC .
+  (?tAC ?tBC) math:sum ?s3 .
+  (?s3  ?tCC) math:sum ?pi3C .
+}
+=>
+{
+  :MC1 :pi3 [ :pA ?pi3A ; :pB ?pi3B ; :pC ?pi3C ] .
+} .
+
+############
+# (3) MATRIX POWER WORKLOAD: A-row of P^2
+############
+
+{
+  :MC1 :row ?rA . ?rA :from :A ; :pA ?AA ; :pB ?AB ; :pC ?AC .
+  :MC1 :row ?rB . ?rB :from :B ; :pA ?BA ; :pB ?BB ; :pC ?BC .
+  :MC1 :row ?rC . ?rC :from :C ; :pA ?CA ; :pB ?CB ; :pC ?CC .
+
+  # (A,A)
+  (?AA ?AA) math:product ?AA_AA .
+  (?AB ?BA) math:product ?AB_BA .
+  (?AC ?CA) math:product ?AC_CA .
+  (?AA_AA ?AB_BA) math:sum ?sAA .
+  (?sAA   ?AC_CA) math:sum ?P2AA .
+
+  # (A,B)
+  (?AA ?AB) math:product ?AA_AB .
+  (?AB ?BB) math:product ?AB_BB .
+  (?AC ?CB) math:product ?AC_CB .
+  (?AA_AB ?AB_BB) math:sum ?sAB .
+  (?sAB   ?AC_CB) math:sum ?P2AB .
+
+  # (A,C)
+  (?AA ?AC) math:product ?AA_AC .
+  (?AB ?BC) math:product ?AB_BC .
+  (?AC ?CC) math:product ?AC_CC .
+  (?AA_AC ?AB_BC) math:sum ?sAC .
+  (?sAC   ?AC_CC) math:sum ?P2AC .
+}
+=>
+{
+  :MC1 :P2rowA [ :pA ?P2AA ; :pB ?P2AB ; :pC ?P2AC ] .
+} .
+
+############
+# (4) METRICS NODES (ground, no existentials-in-disguise)
+############
+
+# Create metric “anchors” for each step
+{ :MC1 :pi0 ?pi . } => { :MC1 :metrics [ :t 0 ; :pi ?pi ] . } .
+{ :MC1 :pi1 ?pi . } => { :MC1 :metrics [ :t 1 ; :pi ?pi ] . } .
+{ :MC1 :pi2 ?pi . } => { :MC1 :metrics [ :t 2 ; :pi ?pi ] . } .
+{ :MC1 :pi3 ?pi . } => { :MC1 :metrics [ :t 3 ; :pi ?pi ] . } .
+
+# Compute (gini, effN, TV, L2) for each metrics node
+{
+  :MC1 :metrics ?m .
+  ?m :pi ?pi .
+  ?pi :pA ?a ; :pB ?b ; :pC ?c .
+
+  # uniform u = 1/3
+  (1.0 3.0) math:quotient ?u .
+
+  # sumSq = a^2 + b^2 + c^2
+  (?a 2.0) math:exponentiation ?a2 .
+  (?b 2.0) math:exponentiation ?b2 .
+  (?c 2.0) math:exponentiation ?c2 .
+  (?a2 ?b2) math:sum ?ab2 .
+  (?ab2 ?c2) math:sum ?sumSq .
+
+  # gini = 1 - sumSq
+  (1.0 ?sumSq) math:difference ?gini .
+
+  # effN = 1 / sumSq
+  (1.0 ?sumSq) math:quotient ?effN .
+
+  # TV = 0.5 * (|a-u| + |b-u| + |c-u|)
+  (?a ?u) math:difference ?da .  ?da math:absoluteValue ?ada .
+  (?b ?u) math:difference ?db .  ?db math:absoluteValue ?adb .
+  (?c ?u) math:difference ?dc .  ?dc math:absoluteValue ?adc .
+  (?ada ?adb) math:sum ?s1 .
+  (?s1  ?adc) math:sum ?sAbs .
+  (0.5 ?sAbs) math:product ?tv .
+
+  # L2 = sqrt( (a-u)^2 + (b-u)^2 + (c-u)^2 )
+  (?da 2.0) math:exponentiation ?da2 .
+  (?db 2.0) math:exponentiation ?db2 .
+  (?dc 2.0) math:exponentiation ?dc2 .
+  (?da2 ?db2) math:sum ?s2 .
+  (?s2  ?dc2) math:sum ?s3 .
+  (?s3  0.5)  math:exponentiation ?l2 .
+}
+=>
+{
+  ?m :sumSq ?sumSq ;
+     :gini ?gini ;
+     :effectiveStates ?effN ;
+     :tvToUniform ?tv ;
+     :l2ToUniform ?l2 .
+} .
+
+# Optional: declare convergence when TV < 0.01
+{
+  :MC1 :metrics ?m .
+  ?m :t ?t ; :tvToUniform ?tv .
+  ?tv math:lessThan 0.01 .
+}
+=>
+{
+  :MC1 :convergedBy ?t .
+} .
+