eyeling 1.5.23 → 1.5.24

package/examples/age.n3

@@ -1,8 +1,7 @@
-# -----------
+# ===========================================
 # Age checker
-# -----------
-#
 # Is the age of a person above some duration?
+# ===========================================
 
 @prefix xsd: <http://www.w3.org/2001/XMLSchema#>.
 @prefix time: <http://www.w3.org/2000/10/swap/time#>.

package/examples/backward.n3

@@ -1,8 +1,7 @@
-# ---------------------
+# ==============================================================
 # Backward rule example
-# ---------------------
-#
 # See https://www.w3.org/2000/10/swap/doc/tutorial-1.pdf page 17
+# ==============================================================
 
 @prefix math: <http://www.w3.org/2000/10/swap/math#>.
 @prefix log: <http://www.w3.org/2000/10/swap/log#>.

package/examples/basic-monadic.n3

@@ -1,8 +1,7 @@
-# -----------------------
+# ======================================================================================
 # Basic Monadic Benchmark
-# -----------------------
-#
 # tested with input of 10^n triples generated with http://josd.github.io/bmb/graphgen.n3
+# ======================================================================================
 
 @prefix : <http://eulersharp.sourceforge.net/2007/07test/graph#>.
 

package/examples/cat-koko.n3

@@ -1,8 +1,7 @@
-# --------
+# =================================
 # Cat Koko
-#---------
-#
 # Example from Patrick Hochstenbach
+# =================================
 
 @prefix : <https://eyereasoner.github.io/ns#>.
 @prefix log: <http://www.w3.org/2000/10/swap/log#>.
@@ -10,9 +9,9 @@
 :Koko a :Animal.
 
 {
-    :Koko a :Animal 
-} 
-=> 
+    :Koko a :Animal
+}
+=>
 {
     { :Koko a :Animal } => { _:x a :Cat } .
     { :Koko a :Animal } => { _:x a :BritishShortHair } .

package/examples/collect-all-in.n3

@@ -1,6 +1,6 @@
-# ------------------------
+# ========================
 # log:collectAllIn example
-# ------------------------
+# ========================
 
 @prefix : <http://example.org/>.
 @prefix log: <http://www.w3.org/2000/10/swap/log#> .
@@ -18,14 +18,14 @@
 
     # Add some extra criteria on variable values to be collected
     ( ?param
-        { 
+        {
             :Let :param ?param .
             ?param string:lessThan "Louie"  .
-        } 
+        }
       ?filteredParams ) log:collectAllIn _:x .
 }
-=> 
-{   
+=>
+{
     :result1 :is ?allParams .
     :result2 :is ?nestedParams .
     :result3 :is ?filteredParams .

package/examples/complex.n3

@@ -1,8 +1,7 @@
-# ---------------
+# ================================================
 # Complex numbers
-# ---------------
-#
 # See https://en.wikipedia.org/wiki/Complex_number
+# ================================================
 
 @prefix math: <http://www.w3.org/2000/10/swap/math#>.
 @prefix log: <http://www.w3.org/2000/10/swap/log#>.

package/examples/control-system.n3

@@ -1,6 +1,6 @@
-# --------------
+# ==============
 # Control System
-# --------------
+# ==============
 
 @prefix math: <http://www.w3.org/2000/10/swap/math#>.
 @prefix : <https://eyereasoner.github.io/eye/reasoning/cs#>.

package/examples/crypto-builtins-tests.n3

@@ -1,6 +1,6 @@
-# ---------------------
+# =====================
 # crypto builtins tests
-# ---------------------
+# =====================
 
 @prefix :       <https://eyereasoner.github.io/ns#> .
 @prefix crypto: <http://www.w3.org/2000/10/swap/crypto#> .

package/examples/deep-taxonomy-10.n3

@@ -1,3 +1,8 @@
+# =============================================================================================================================  
+# Deep Taxonomy - depth 10
+# See https://web.archive.org/web/20220119222608/http://responder.ruleml.org/WellnessRules/files/WellnessRulesN3-2009-11-10.pdf
+# =============================================================================================================================  
+
 @prefix : <http://eulersharp.sourceforge.net/2009/12dtb/test#>.
 
 # fact

package/examples/deep-taxonomy-100.n3

@@ -1,3 +1,8 @@
+# =============================================================================================================================  
+# Deep Taxonomy - depth 100
+# See https://web.archive.org/web/20220119222608/http://responder.ruleml.org/WellnessRules/files/WellnessRulesN3-2009-11-10.pdf
+# =============================================================================================================================  
+
 @prefix : <http://eulersharp.sourceforge.net/2009/12dtb/test#>.
 
 # fact

package/examples/deep-taxonomy-1000.n3

@@ -1,3 +1,8 @@
+# =============================================================================================================================  
+# Deep Taxonomy - depth 1000
+# See https://web.archive.org/web/20220119222608/http://responder.ruleml.org/WellnessRules/files/WellnessRulesN3-2009-11-10.pdf
+# =============================================================================================================================  
+
 @prefix : <http://eulersharp.sourceforge.net/2009/12dtb/test#>.
 
 # fact

package/examples/deep-taxonomy-10000.n3

@@ -1,3 +1,8 @@
+# =============================================================================================================================  
+# Deep Taxonomy - depth 10000
+# See https://web.archive.org/web/20220119222608/http://responder.ruleml.org/WellnessRules/files/WellnessRulesN3-2009-11-10.pdf
+# =============================================================================================================================  
+
 @prefix : <http://eulersharp.sourceforge.net/2009/12dtb/test#>.
 
 # fact

package/examples/derived-backward-rule-2.n3

@@ -1,8 +1,7 @@
-# ---------------------
+# =================================
 # Derived backward rule
-# ---------------------
-#
 # Example from Patrick Hochstenbach
+# =================================
 
 @prefix rdfs: <http://www.w3.org/2000/01/rdf-schema#>.
 @prefix : <http://example.org/socrates#>.

package/examples/derived-backward-rule.n3

@@ -1,6 +1,6 @@
-# ---------------------
+# =====================
 # Derived backward rule
-# ---------------------
+# =====================
 
 @prefix log: <http://www.w3.org/2000/10/swap/log#> .
 @prefix :    <https://eyereasoner.github.io/ns#> .

package/examples/derived-rule.n3

@@ -1,6 +1,6 @@
-# ------------
+# ============
 # Derived rule
-# ------------
+# ============
 
 @prefix log: <http://www.w3.org/2000/10/swap/log#>.
 @prefix : <https://eyereasoner.github.io/ns#>.

package/examples/dijkstra.n3

@@ -1,8 +1,7 @@
-# ----------------------------------------------
+# ===========================================================
 # Dijkstra's algorithm to find the shortest path
-# ----------------------------------------------
-#
 # Original from https://github.com/agx-r/Dijkstra-s-Algorithm
+# ===========================================================
 
 @prefix list: <http://www.w3.org/2000/10/swap/list#>.
 @prefix math: <http://www.w3.org/2000/10/swap/math#>.

package/examples/dog.n3

@@ -1,8 +1,7 @@
-# -------------------
+# ===============================================
 # Dog license example
-# -------------------
-#
 # If you have more than 4 dogs you need a license.
+# ===============================================
 
 @prefix log: <http://www.w3.org/2000/10/swap/log#>.
 @prefix math: <http://www.w3.org/2000/10/swap/math#>.

package/examples/drone-corridor-planner-v2.n3

@@ -0,0 +1,237 @@
+# ========================================================================================
+# Drone Corridor Planner v2 (example N3 program)
+#
+# What this file is
+# - A tiny “planner” written in Notation3 (N3): it searches for a sequence of
+#   actions that moves a drone from a start state to a goal state.
+# - Intended to run in an N3 reasoner that supports forward rules (`=>`),
+#   backward rules (`<=`), and a few built-ins (e.g., `math:*`, `list:*`).
+#
+# How to run (one simple option)
+# - With the JavaScript `eyeling` CLI:
+#     npx eyeling examples/drone-corridor-planner-v2.n3
+#   The output will be newly derived facts, including one or more `gps:plan`
+#   results (see “Output” below).
+#
+# Big idea (in plain terms)
+# - We describe a “world” as a small set of facts: location, battery level,
+#   and whether the drone has a permit.
+# - We describe each possible action (fly, train, charge, buy/get permit) as a
+#   state transition:  FROM-state  ->  TO-state  plus some numeric “weights”.
+# - The rules then *compose* these transitions into multi-step plans while
+#   aggregating the weights (e.g., add durations, multiply beliefs).
+#
+# Reading the action descriptions
+# - Each action is encoded as a `gps:description` with this shape:
+#     ( FROM  true  TO  :actionName  duration  cost  belief  comfort )
+#   where:
+#   - FROM / TO are little graphs in `{ ... }` describing the state.
+#   - `true` is a placeholder “precondition” (kept for symmetry with richer
+#     variants where extra conditions may appear).
+#   - duration/cost/belief/comfort are example numbers used for scoring/pruning.
+#
+# Bounded search (why it doesn’t loop forever)
+# - The planner is *fuel-bounded*: it carries a list of “fuel tokens” and
+#   consumes one token per step. When fuel runs out, expansion stops.
+# - This is important because the map can contain cycles (e.g., going back to a
+#   previous city). Fuel-bounding keeps the search safe and finite.
+#
+# How scores are combined across a multi-step plan
+# - Duration and cost are summed.
+# - Belief and comfort are multiplied (so long plans tend to reduce them).
+# - The list of actions is built by appending each step’s action name.
+#
+# Output (what you should expect to see)
+# - The “Query” section asks for plans that take the drone from the initial
+#   state to the goal (Oostende), then prunes bad plans using thresholds like:
+#     belief > ...  and  cost < ...
+# - Each surviving plan is reported as a derived fact like:
+#     :d1 gps:plan ( ...actions... duration cost belief comfort battery permit fuelLeft ).
+#
+# Customizing this example
+# - Add/edit `gps:description` lines to introduce new routes/actions.
+# - Change the initial state (`:d1 :location ...`, `:battery ...`, `:permit ...`).
+# - Adjust `:fuel7` (more/less steps) and the pruning thresholds in the Query.
+#
+# Notes
+# - This is a *toy* corridor-planning model meant to illustrate rule-based
+#   planning patterns. The numeric values and “units” are illustrative.
+# ========================================================================================
+
+@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#>.
+
+# ----------------
+# current state
+# ----------------
+:d1 :location :Gent.
+:d1 :battery  :full.
+:d1 :permit   :none.
+
+# bounded search horizon (7 steps max)
+:fuel7 :value (:t :t :t :t :t :t :t).
+
+# -----------------------------------------------------------------
+# "map" / action descriptions (as backward rules)
+# State = { ?S :location ... . ?S :battery ... . ?S :permit ... . }
+# -----------------------------------------------------------------
+# two ways to reach Brugge (tradeoff: cost/comfort)
+{:map-DRONE gps:description (
+  {?S :location :Gent.   ?S :battery :full. ?S :permit ?P.} true
+  {?S :location :Brugge. ?S :battery :mid.  ?S :permit ?P.}
+  :fly_gent_brugge
+  1500.0 0.006 0.99 0.99
+)} <= true.
+
+{:map-DRONE gps:description (
+  {?S :location :Gent.   ?S :battery ?B.    ?S :permit ?P.} true
+  {?S :location :Brugge. ?S :battery ?B.    ?S :permit ?P.}
+  :train_gent_brugge
+  1700.0 0.012 0.999 0.995
+)} <= true.
+
+# via Kortrijk (permit + charging opportunities)
+{:map-DRONE gps:description (
+  {?S :location :Gent.     ?S :battery :full. ?S :permit ?P.} true
+  {?S :location :Kortrijk. ?S :battery :mid.  ?S :permit ?P.}
+  :fly_gent_kortrijk
+  1600.0 0.007 0.99 0.99
+)} <= true.
+
+{:map-DRONE gps:description (
+  {?S :location :Kortrijk. ?S :battery :mid.  ?S :permit ?P.} true
+  {?S :location :Brugge.   ?S :battery :low.  ?S :permit ?P.}
+  :fly_kortrijk_brugge
+  1600.0 0.007 0.99 0.99
+)} <= true.
+
+# cycle edge (safe due to fuel bound; typically pruned by belief threshold)
+{:map-DRONE gps:description (
+  {?S :location :Brugge.   ?S :battery :mid.  ?S :permit ?P.} true
+  {?S :location :Kortrijk. ?S :battery :low.  ?S :permit ?P.}
+  :fly_brugge_kortrijk
+  1600.0 0.007 0.985 0.98
+)} <= true.
+
+# get permit in Kortrijk (best belief)
+{:map-DRONE gps:description (
+  {?S :location :Kortrijk. ?S :battery ?B. ?S :permit :none.} true
+  {?S :location :Kortrijk. ?S :battery ?B. ?S :permit :yes.}
+  :get_zone_permit_kortrijk
+  300.0 0.001 0.999 1.0
+)} <= true.
+
+# get permit in Brugge (faster, but lower belief)
+{:map-DRONE gps:description (
+  {?S :location :Brugge. ?S :battery ?B. ?S :permit :none.} true
+  {?S :location :Brugge. ?S :battery ?B. ?S :permit :yes.}
+  :buy_permit_brugge
+  450.0 0.002 0.98 1.0
+)} <= true.
+
+# charging options
+{:map-DRONE gps:description (
+  {?S :location :Brugge. ?S :battery :low. ?S :permit ?P.} true
+  {?S :location :Brugge. ?S :battery :full. ?S :permit ?P.}
+  :quick_charge_brugge
+  600.0 0.004 0.999 0.97
+)} <= true.
+
+{:map-DRONE gps:description (
+  {?S :location :Brugge. ?S :battery :mid. ?S :permit ?P.} true
+  {?S :location :Brugge. ?S :battery :full. ?S :permit ?P.}
+  :topup_brugge
+  400.0 0.003 0.999 0.98
+)} <= true.
+
+{:map-DRONE gps:description (
+  {?S :location :Kortrijk. ?S :battery :mid. ?S :permit ?P.} true
+  {?S :location :Kortrijk. ?S :battery :full. ?S :permit ?P.}
+  :emergency_charge_kortrijk
+  500.0 0.003 0.999 0.95
+)} <= true.
+
+# to Oostende: three alternatives
+# A) restricted corridor: fastest+comfortable, but requires permit=yes and full battery
+{:map-DRONE gps:description (
+  {?S :location :Brugge. ?S :battery :full. ?S :permit :yes.} true
+  {?S :location :Oostende. ?S :battery :mid. ?S :permit :yes.}
+  :cross_corridor_brugge_oostende
+  900.0 0.004 0.98 1.0
+)} <= true.
+
+# B) public coastline: no permit required, slower
+{:map-DRONE gps:description (
+  {?S :location :Brugge. ?S :battery :mid. ?S :permit ?P.} true
+  {?S :location :Oostende. ?S :battery :low. ?S :permit ?P.}
+  :public_coastline_brugge_oostende
+  1300.0 0.006 0.97 0.96
+)} <= true.
+
+{:map-DRONE gps:description (
+  {?S :location :Brugge. ?S :battery :full. ?S :permit ?P.} true
+  {?S :location :Oostende. ?S :battery :mid. ?S :permit ?P.}
+  :public_coastline_brugge_oostende
+  1200.0 0.006 0.975 0.96
+)} <= true.
+
+# C) Kortrijk shortcut: requires permit and full battery; quicker but lower comfort
+{:map-DRONE gps:description (
+  {?S :location :Kortrijk. ?S :battery :full. ?S :permit :yes.} true
+  {?S :location :Oostende. ?S :battery :mid. ?S :permit :yes.}
+  :direct_corridor_kortrijk_oostende
+  1100.0 0.009 0.955 0.92
+)} <= true.
+
+# -------------------------------------------------
+# planner: compute all bounded paths
+# -------------------------------------------------
+# Base: one description is a path (consume 1 fuel token)
+{
+  (?From ?To (?Act) ?Dur ?Cost ?Bel ?Comf ?FuelIn ?FuelOut) :path true.
+}
+<=
+{
+  :map-DRONE gps:description (?From true ?To ?Act ?Dur ?Cost ?Bel ?Comf).
+  ?FuelIn list:rest ?FuelOut.
+}.
+
+# Recursive: chain one step + rest path, aggregate weights, consume 1 fuel token
+{
+  (?From ?To ?Actions ?Dur ?Cost ?Bel ?Comf ?FuelIn ?FuelOut) :path true.
+}
+<=
+{
+  :map-DRONE gps:description (?From true ?Mid ?Act ?Dur1 ?Cost1 ?Bel1 ?Comf1).
+
+  ?FuelIn list:rest ?FuelMid.
+  (?Mid ?To ?RestActs ?Dur2 ?Cost2 ?Bel2 ?Comf2 ?FuelMid ?FuelOut) :path true.
+
+  ((?Act) ?RestActs) list:append ?Actions.
+
+  (?Dur1  ?Dur2)  math:sum     ?Dur.
+  (?Cost1 ?Cost2) math:sum     ?Cost.
+  (?Bel1  ?Bel2)  math:product ?Bel.
+  (?Comf1 ?Comf2) math:product ?Comf.
+}.
+
+# -------------------------------------------------
+# Query: plans for d1 to Oostende with pruning thresholds
+# -------------------------------------------------
+{
+  :fuel7 :value ?Fuel.
+
+  ({:d1 :location :Gent. :d1 :battery :full. :d1 :permit :none.}
+   {:d1 :location :Oostende. :d1 :battery ?B. :d1 :permit ?P.}
+   ?Acts ?Dur ?Cost ?Bel ?Comf ?Fuel ?FuelLeft) :path true.
+
+  ?Bel  math:greaterThan 0.94.
+  ?Cost math:lessThan    0.03.
+}
+=>
+{
+  :d1 gps:plan (?Acts ?Dur ?Cost ?Bel ?Comf ?B ?P ?FuelLeft).
+}.
+

package/examples/drone-corridor-planner.n3

@@ -0,0 +1,131 @@
+# =====================================================================================
+# Drone Corridor Planner
+# Fuel-bounded drone planning in N3: chain quoted-state transitions, aggregate weights,
+# and enforce permit/battery constraints while remaining safe under cycles.
+# =====================================================================================
+
+@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#>.
+
+# Fuel-bounded drone planning in N3: chain quoted-state transitions, aggregate weights, and enforce permit/battery constraints while remaining safe under cycles.
+
+# ----------------
+# current state
+# ----------------
+:d1 :location :Gent.
+:d1 :battery  :full.
+:d1 :permit   :none.
+
+# bounded search horizon (6 steps max)
+:fuel6 :value (:t :t :t :t :t :t).
+
+# -------------------------------------------------
+# "map" / action descriptions (as backward rules)
+# -------------------------------------------------
+{:map-DRONE gps:description (
+  {?S :location :Gent.     ?S :battery :full. ?S :permit ?P.}  true
+  {?S :location :Brugge.   ?S :battery :mid.  ?S :permit ?P.}
+  :fly_gent_brugge
+  1500.0 0.006 0.99 0.99
+)} <= true.
+
+{:map-DRONE gps:description (
+  {?S :location :Gent.     ?S :battery :full. ?S :permit ?P.}  true
+  {?S :location :Kortrijk. ?S :battery :mid.  ?S :permit ?P.}
+  :fly_gent_kortrijk
+  1600.0 0.007 0.99 0.99
+)} <= true.
+
+{:map-DRONE gps:description (
+  {?S :location :Kortrijk. ?S :battery :mid.  ?S :permit ?P.}  true
+  {?S :location :Brugge.   ?S :battery :low.  ?S :permit ?P.}
+  :fly_kortrijk_brugge
+  1600.0 0.007 0.99 0.99
+)} <= true.
+
+# cycle edge (safe due to fuel bound)
+{:map-DRONE gps:description (
+  {?S :location :Brugge.   ?S :battery :mid.  ?S :permit ?P.}  true
+  {?S :location :Kortrijk. ?S :battery :low.  ?S :permit ?P.}
+  :fly_brugge_kortrijk
+  1600.0 0.007 0.985 0.98
+)} <= true.
+
+# permit acquisition (only in Kortrijk)
+{:map-DRONE gps:description (
+  {?S :location :Kortrijk. ?S :battery ?B.    ?S :permit :none.} true
+  {?S :location :Kortrijk. ?S :battery ?B.    ?S :permit :yes.}
+  :get_zone_permit
+  300.0 0.001 0.999 1.0
+)} <= true.
+
+# charging (low -> full)
+{:map-DRONE gps:description (
+  {?S :location :Brugge.   ?S :battery :low.  ?S :permit ?P.}  true
+  {?S :location :Brugge.   ?S :battery :full. ?S :permit ?P.}
+  :quick_charge_brugge
+  600.0 0.004 0.999 0.97
+)} <= true.
+
+# restricted corridor to Oostende requires permit=yes
+{:map-DRONE gps:description (
+  {?S :location :Brugge.   ?S :battery :full. ?S :permit :yes.} true
+  {?S :location :Oostende. ?S :battery :mid.  ?S :permit :yes.}
+  :cross_corridor_brugge_oostende
+  900.0 0.004 0.98 1.0
+)} <= true.
+
+# -------------------------------------------------
+# planner: compute all bounded paths
+# -------------------------------------------------
+# Base: one description is a path (consume 1 fuel token)
+{
+  (?From ?To (?Act) ?Dur ?Cost ?Bel ?Comf ?FuelIn ?FuelOut) :path true.
+}
+<=
+{
+  :map-DRONE gps:description (?From true ?To ?Act ?Dur ?Cost ?Bel ?Comf).
+  ?FuelIn list:rest ?FuelOut.
+}.
+
+# Recursive: chain one step + rest path, aggregate weights, consume 1 fuel token
+{
+  (?From ?To ?Actions ?Dur ?Cost ?Bel ?Comf ?FuelIn ?FuelOut) :path true.
+}
+<=
+{
+  :map-DRONE gps:description (?From true ?Mid ?Act ?Dur1 ?Cost1 ?Bel1 ?Comf1).
+
+  ?FuelIn list:rest ?FuelMid.
+  (?Mid ?To ?RestActs ?Dur2 ?Cost2 ?Bel2 ?Comf2 ?FuelMid ?FuelOut) :path true.
+
+  ((?Act) ?RestActs) list:append ?Actions.
+
+  (?Dur1  ?Dur2)  math:sum     ?Dur.
+  (?Cost1 ?Cost2) math:sum     ?Cost.
+  (?Bel1  ?Bel2)  math:product ?Bel.
+  (?Comf1 ?Comf2) math:product ?Comf.
+}.
+
+# -------------------------------------------------
+# Query: plans for d1 to Oostende with thresholds
+# -------------------------------------------------
+{
+  :fuel6 :value ?Fuel.
+
+  ({:d1 :location :Gent. :d1 :battery :full. :d1 :permit :none.}
+   {:d1 :location :Oostende. :d1 :battery ?B. :d1 :permit ?P.}
+   ?Acts ?Dur ?Cost ?Bel ?Comf ?Fuel ?FuelLeft) :path true.
+
+  ?Bel  math:greaterThan 0.95.
+  ?Cost math:lessThan    0.05.
+}
+=>
+{
+  :d1 gps:plan (?Acts ?Dur ?Cost ?Bel ?Comf ?FuelLeft).
+  :d1 :finalBattery ?B.
+  :d1 :finalPermit  ?P.
+}.
+

package/examples/equals.n3

@@ -1,12 +1,11 @@
-# -----------
+# =================================
 # Equals test
-# -----------
-#
 # Example from Patrick Hochstenbach
+# =================================
 
 @prefix owl: <http://www.w3.org/2002/07/owl#> .
 @prefix : <http://example.org/socrates#>.
 
-:X = :Y . 
+:X = :Y .
 
 { :X owl:sameAs :Y } => { :test :is true }.

package/examples/existential-rule.n3

@@ -1,6 +1,6 @@
-# ----------------
+# ================
 # Existential rule
-# ----------------
+# ================
 
 @prefix rdfs: <http://www.w3.org/2000/01/rdf-schema#>.
 @prefix : <http://example.org/socrates#>.

package/examples/expression-eval.n3

@@ -1,11 +1,10 @@
-# ---------------------------------
+# ==============================================================================
 # 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#>.

package/examples/family-cousins.n3

@@ -1,6 +1,6 @@
-# --------------
+# ==============
 # Family cousins
-# --------------
+# ==============
 
 @prefix : <http://example.org/family#>.
 @prefix math: <http://www.w3.org/2000/10/swap/math#>.

package/examples/fibonacci.n3

@@ -1,8 +1,7 @@
-# -----------------
+# ==================================================
 # Fibonacci numbers
-# -----------------
-#
 # See https://en.wikipedia.org/wiki/Fibonacci_number
+# ==================================================
 
 @prefix math: <http://www.w3.org/2000/10/swap/math#>.
 @prefix : <https://eyereasoner.github.io/eye/reasoning#>.

package/examples/for-all-in.n3

@@ -1,6 +1,6 @@
-# --------------------
+# ====================
 # log:forAllIn example
-# --------------------
+# ====================
 
 @prefix : <http://example.org/>.
 @prefix log: <http://www.w3.org/2000/10/swap/log#> .

package/examples/french-cities.n3

@@ -1,8 +1,7 @@
-# ----------------------
+# ============================================
 # Traversing Graph Paths
-# ----------------------
-#
 # Simple data & rules over a tiny city dataset
+# ============================================
 
 @prefix log: <http://www.w3.org/2000/10/swap/log#>.
 @prefix owl: <http://www.w3.org/2002/07/owl#>.