eyeling 1.24.5 → 1.24.7

package/see/examples/doc/equals.md

@@ -1,26 +0,0 @@
-# Equals test
-
-Generated by `see.js` from a Notation3 source file.
-
-Example from Patrick Hochstenbach
-
-## Compilation summary
-
-- Example name: `equals`
-- Input facts emitted: 1
-- Forward rules compiled: 1
-- Backward predicate rules compiled: 0
-- Fuses compiled: 0
-- Predicate count: 2
-
-## Built-ins used
-
-- none
-
-## Runtime model
-
-The generated `examples/equals.js` is a specialized JavaScript derivation program. For ordinary sources, `see.js` emits the source facts as `examples/input/equals.trig`. For rules-only sources, generation can reuse an existing external evidence file such as `examples/input/equals.trig` or `examples/input/equals.trig`. The runner reads that TriG evidence directly and performs a local fixpoint derivation; it does not parse the program source or call an external reasoner.
-
-## Output model
-
-Running `node examples/equals.js` produces a SEE-style Markdown report with an **Entailment** section, an **Explanation** section, and a **Formal TriG Output** section containing the selected derived/query facts.

package/see/examples/doc/equivalence_classes_overlap_implies_same_class.md

@@ -1,24 +0,0 @@
-# If two equivalence classes share an element, they are the same class.
-
-Generated by `see.js` from a Notation3 source file.
-
-## Compilation summary
-
-- Example name: `equivalence_classes_overlap_implies_same_class`
-- Input facts emitted: 5
-- Forward rules compiled: 7
-- Backward predicate rules compiled: 0
-- Fuses compiled: 0
-- Predicate count: 7
-
-## Built-ins used
-
-- `log:notEqualTo`
-
-## Runtime model
-
-The generated `examples/equivalence_classes_overlap_implies_same_class.js` is a specialized JavaScript derivation program. For ordinary sources, `see.js` emits the source facts as `examples/input/equivalence_classes_overlap_implies_same_class.trig`. For rules-only sources, generation can reuse an existing external evidence file such as `examples/input/equivalence-classes-overlap-implies-same-class.trig` or `examples/input/equivalence_classes_overlap_implies_same_class.trig`. The runner reads that TriG evidence directly and performs a local fixpoint derivation; it does not parse the program source or call an external reasoner.
-
-## Output model
-
-Running `node examples/equivalence_classes_overlap_implies_same_class.js` produces a SEE-style Markdown report with an **Entailment** section, an **Explanation** section, and a **Formal TriG Output** section containing the selected derived/query facts.

package/see/examples/doc/euler_identity.md

@@ -1,39 +0,0 @@
-# Euler identity (exact, certificate-friendly):
-
-Generated by `see.js` from a Notation3 source file.
-
-exp(i*pi) + 1 = 0
-Philosophy:
-Unlike the T-gate example, this phase needs no approximation. exp(i*pi) lands exactly at
-(-1,0) = cos(pi) + i sin(pi), so the identity can be certified using integer arithmetic
-alone.
-Method:
-1) Construct -1 as 0 - 1.
-2) Represent exp(i*pi) exactly as (-1, 0).
-3) Add 1 componentwise to obtain (0, 0).
-4) Sanity validation the phase modulus: |-1 + 0i|^2 = 1.
-5) Project only the intended certificates via log:query.
-
-## Compilation summary
-
-- Example name: `euler_identity`
-- Input facts emitted: 10
-- Forward rules compiled: 5
-- Backward predicate rules compiled: 0
-- Fuses compiled: 0
-- Predicate count: 21
-
-## Built-ins used
-
-- `math:difference`
-- `math:equalTo`
-- `math:product`
-- `math:sum`
-
-## Runtime model
-
-The generated `examples/euler_identity.js` is a specialized JavaScript derivation program. For ordinary sources, `see.js` emits the source facts as `examples/input/euler_identity.trig`. For rules-only sources, generation can reuse an existing external evidence file such as `examples/input/euler-identity.trig` or `examples/input/euler_identity.trig`. The runner reads that TriG evidence directly and performs a local fixpoint derivation; it does not parse the program source or call an external reasoner.
-
-## Output model
-
-Running `node examples/euler_identity.js` produces a SEE-style Markdown report with an **Entailment** section, an **Explanation** section, and a **Formal TriG Output** section containing the selected derived/query facts.

package/see/examples/doc/ev_roundtrip_planner.md

@@ -1,32 +0,0 @@
-# EV Roadtrip Planner
-
-Generated by `see.js` from a Notation3 source file.
-
-N3-compiled version of the hand-written EV roadtrip planner. Candidate plans
-are represented as data; rules apply the same acceptance thresholds and select
-the fastest acceptable route.
-
-## Compilation summary
-
-- Example name: `ev_roundtrip_planner`
-- Input facts emitted: 64
-- Forward rules compiled: 3
-- Backward predicate rules compiled: 0
-- Fuses compiled: 1
-- Predicate count: 27
-
-## Built-ins used
-
-- `log:notIncludes`
-- `log:outputString`
-- `math:greaterThan`
-- `math:lessThan`
-- `string:format`
-
-## Runtime model
-
-The generated `examples/ev_roundtrip_planner.js` is a specialized JavaScript derivation program. For ordinary sources, `see.js` emits the source facts as `examples/input/ev_roundtrip_planner.trig`. For rules-only sources, generation can reuse an existing external evidence file such as `examples/input/ev-roundtrip-planner.trig` or `examples/input/ev_roundtrip_planner.trig`. The runner reads that TriG evidence directly and performs a local fixpoint derivation; it does not parse the program source or call an external reasoner.
-
-## Output model
-
-Running `node examples/ev_roundtrip_planner.js` produces a SEE-style Markdown report with an **Entailment** section, an **Explanation** section, and a **Formal TriG Output** section containing the selected derived/query facts.

package/see/examples/doc/existential_rule.md

@@ -1,24 +0,0 @@
-# Existential rule
-
-Generated by `see.js` from a Notation3 source file.
-
-## Compilation summary
-
-- Example name: `existential_rule`
-- Input facts emitted: 2
-- Forward rules compiled: 1
-- Backward predicate rules compiled: 0
-- Fuses compiled: 0
-- Predicate count: 2
-
-## Built-ins used
-
-- none
-
-## Runtime model
-
-The generated `examples/existential_rule.js` is a specialized JavaScript derivation program. For ordinary sources, `see.js` emits the source facts as `examples/input/existential_rule.trig`. For rules-only sources, generation can reuse an existing external evidence file such as `examples/input/existential-rule.trig` or `examples/input/existential_rule.trig`. The runner reads that TriG evidence directly and performs a local fixpoint derivation; it does not parse the program source or call an external reasoner.
-
-## Output model
-
-Running `node examples/existential_rule.js` produces a SEE-style Markdown report with an **Entailment** section, an **Explanation** section, and a **Formal TriG Output** section containing the selected derived/query facts.

package/see/examples/doc/expression_eval.md

@@ -1,26 +0,0 @@
-# A tiny expression evaluator in N3
-
-Generated by `see.js` from a Notation3 source file.
-
-## Compilation summary
-
-- Example name: `expression_eval`
-- Input facts emitted: 17
-- Forward rules compiled: 1
-- Backward predicate rules compiled: 4
-- Fuses compiled: 0
-- Predicate count: 11
-
-## Built-ins used
-
-- `math:difference`
-- `math:product`
-- `math:sum`
-
-## Runtime model
-
-The generated `examples/expression_eval.js` is a specialized JavaScript derivation program. For ordinary sources, `see.js` emits the source facts as `examples/input/expression_eval.trig`. For rules-only sources, generation can reuse an existing external evidence file such as `examples/input/expression-eval.trig` or `examples/input/expression_eval.trig`. The runner reads that TriG evidence directly and performs a local fixpoint derivation; it does not parse the program source or call an external reasoner.
-
-## Output model
-
-Running `node examples/expression_eval.js` produces a SEE-style Markdown report with an **Entailment** section, an **Explanation** section, and a **Formal TriG Output** section containing the selected derived/query facts.

package/see/examples/doc/family_cousins.md

@@ -1,24 +0,0 @@
-# Family cousins
-
-Generated by `see.js` from a Notation3 source file.
-
-## Compilation summary
-
-- Example name: `family_cousins`
-- Input facts emitted: 15
-- Forward rules compiled: 4
-- Backward predicate rules compiled: 0
-- Fuses compiled: 0
-- Predicate count: 6
-
-## Built-ins used
-
-- `math:sum`
-
-## Runtime model
-
-The generated `examples/family_cousins.js` is a specialized JavaScript derivation program. For ordinary sources, `see.js` emits the source facts as `examples/input/family_cousins.trig`. For rules-only sources, generation can reuse an existing external evidence file such as `examples/input/family-cousins.trig` or `examples/input/family_cousins.trig`. The runner reads that TriG evidence directly and performs a local fixpoint derivation; it does not parse the program source or call an external reasoner.
-
-## Output model
-
-Running `node examples/family_cousins.js` produces a SEE-style Markdown report with an **Entailment** section, an **Explanation** section, and a **Formal TriG Output** section containing the selected derived/query facts.

package/see/examples/doc/fastpow.md

@@ -1,29 +0,0 @@
-# Fast exponentiation demo
-
-Generated by `see.js` from a Notation3 source file.
-
-## Compilation summary
-
-- Example name: `fastpow`
-- Input facts emitted: 0
-- Forward rules compiled: 1
-- Backward predicate rules compiled: 7
-- Fuses compiled: 0
-- Predicate count: 12
-
-## Built-ins used
-
-- `math:difference`
-- `math:equalTo`
-- `math:exponentiation`
-- `math:greaterThan`
-- `math:product`
-- `math:remainder`
-
-## Runtime model
-
-The generated `examples/fastpow.js` is a specialized JavaScript derivation program. For ordinary sources, `see.js` emits the source facts as `examples/input/fastpow.trig`. For rules-only sources, generation can reuse an existing external evidence file such as `examples/input/fastpow.trig` or `examples/input/fastpow.trig`. The runner reads that TriG evidence directly and performs a local fixpoint derivation; it does not parse the program source or call an external reasoner.
-
-## Output model
-
-Running `node examples/fastpow.js` produces a SEE-style Markdown report with an **Entailment** section, an **Explanation** section, and a **Formal TriG Output** section containing the selected derived/query facts.

package/see/examples/doc/fibonacci.md

@@ -1,28 +0,0 @@
-# Fibonacci Example (Big)
-
-Generated by `see.js` from a Notation3 source file.
-
-N3-compiled version of the exact Fibonacci example. The target and sample indices are represented as formal TriG input
-evidence when this source is compiled.
-
-## Compilation summary
-
-- Example name: `fibonacci`
-- Input facts emitted: 27
-- Forward rules compiled: 1
-- Backward predicate rules compiled: 0
-- Fuses compiled: 0
-- Predicate count: 11
-
-## Built-ins used
-
-- `log:outputString`
-- `string:format`
-
-## Runtime model
-
-The generated `examples/fibonacci.js` is a specialized JavaScript derivation program. For ordinary sources, `see.js` emits the source facts as `examples/input/fibonacci.trig`. For rules-only sources, generation can reuse an existing external evidence file such as `examples/input/fibonacci.trig` or `examples/input/fibonacci.trig`. The runner reads that TriG evidence directly and performs a local fixpoint derivation; it does not parse the program source or call an external reasoner.
-
-## Output model
-
-Running `node examples/fibonacci.js` produces a SEE-style Markdown report with an **Entailment** section, an **Explanation** section, and a **Formal TriG Output** section containing the selected derived/query facts.

package/see/examples/doc/french_cities.md

@@ -1,28 +0,0 @@
-# French cities — graph path traversal.
-
-Generated by `see.js` from a Notation3 source file.
-
-Based on the EYE reasoning/graph example: graph.axiom.n3 plus graph.filter.n3.
-It asks whether Paris can reach Nantes by following one-way links, using a
-subproperty rule and a transitive-property rule.
-
-## Compilation summary
-
-- Example name: `french_cities`
-- Input facts emitted: 12
-- Forward rules compiled: 2
-- Backward predicate rules compiled: 0
-- Fuses compiled: 0
-- Predicate count: 6
-
-## Built-ins used
-
-- none
-
-## Runtime model
-
-The generated `examples/french_cities.js` is a specialized JavaScript derivation program. For ordinary sources, `see.js` emits the source facts as `examples/input/french_cities.trig`. For rules-only sources, generation can reuse an existing external evidence file such as `examples/input/french-cities.trig` or `examples/input/french_cities.trig`. The runner reads that TriG evidence directly and performs a local fixpoint derivation; it does not parse the program source or call an external reasoner.
-
-## Output model
-
-Running `node examples/french_cities.js` produces a SEE-style Markdown report with an **Entailment** section, an **Explanation** section, and a **Formal TriG Output** section containing the selected derived/query facts.

package/see/examples/doc/fundamental_theorem_arithmetic.md

@@ -1,36 +0,0 @@
-# Fundamental Theorem Arithmetic
-
-Generated by `see.js` from a Notation3 source file.
-
-N3-compiled version of the hand-written SEE example. The primary case mirrors
-Eyeling's fundamental-theorem-arithmetic.n3: n = 202692987 is validated against
-the factorization 3^2 * 7 * 829 * 3881. Extra sample summaries are kept as
-data so the SEE report still documents the larger regression set.
-
-## Compilation summary
-
-- Example name: `fundamental_theorem_arithmetic`
-- Input facts emitted: 16
-- Forward rules compiled: 4
-- Backward predicate rules compiled: 0
-- Fuses compiled: 3
-- Predicate count: 25
-
-## Built-ins used
-
-- `list:reverse`
-- `list:sort`
-- `log:equalTo`
-- `log:notIncludes`
-- `log:outputString`
-- `math:equalTo`
-- `math:product`
-- `string:format`
-
-## Runtime model
-
-The generated `examples/fundamental_theorem_arithmetic.js` is a specialized JavaScript derivation program. For ordinary sources, `see.js` emits the source facts as `examples/input/fundamental_theorem_arithmetic.trig`. For rules-only sources, generation can reuse an existing external evidence file such as `examples/input/fundamental-theorem-arithmetic.trig` or `examples/input/fundamental_theorem_arithmetic.trig`. The runner reads that TriG evidence directly and performs a local fixpoint derivation; it does not parse the program source or call an external reasoner.
-
-## Output model
-
-Running `node examples/fundamental_theorem_arithmetic.js` produces a SEE-style Markdown report with an **Entailment** section, an **Explanation** section, and a **Formal TriG Output** section containing the selected derived/query facts.

package/see/examples/doc/genetic_knapsack_selection.md

@@ -1,29 +0,0 @@
-# Genetic Knapsack Selection
-
-Generated by `see.js` from a Notation3 source file.
-
-N3-compiled version of the deterministic one-bit mutation knapsack example.
-The original item list JSON is preserved as the data-input sidecar.
-
-## Compilation summary
-
-- Example name: `genetic_knapsack_selection`
-- Input facts emitted: 14
-- Forward rules compiled: 2
-- Backward predicate rules compiled: 0
-- Fuses compiled: 0
-- Predicate count: 17
-
-## Built-ins used
-
-- `log:outputString`
-- `math:notGreaterThan`
-- `string:format`
-
-## Runtime model
-
-The generated `examples/genetic_knapsack_selection.js` is a specialized JavaScript derivation program. For ordinary sources, `see.js` emits the source facts as `examples/input/genetic_knapsack_selection.trig`. For rules-only sources, generation can reuse an existing external evidence file such as `examples/input/genetic-knapsack-selection.trig` or `examples/input/genetic_knapsack_selection.trig`. The runner reads that TriG evidence directly and performs a local fixpoint derivation; it does not parse the program source or call an external reasoner.
-
-## Output model
-
-Running `node examples/genetic_knapsack_selection.js` produces a SEE-style Markdown report with an **Entailment** section, an **Explanation** section, and a **Formal TriG Output** section containing the selected derived/query facts.

package/see/examples/doc/goldbach_1000.md

@@ -1,31 +0,0 @@
-# Goldbach 1000
-
-Generated by `see.js` from a Notation3 source file.
-
-N3-compiled version of the bounded Goldbach SEE example. It keeps the bounded
-result as committed data and uses rules to verify the representative witness
-equations that are shown in the report.
-
-## Compilation summary
-
-- Example name: `goldbach_1000`
-- Input facts emitted: 28
-- Forward rules compiled: 3
-- Backward predicate rules compiled: 0
-- Fuses compiled: 1
-- Predicate count: 16
-
-## Built-ins used
-
-- `log:notIncludes`
-- `log:outputString`
-- `math:sum`
-- `string:format`
-
-## Runtime model
-
-The generated `examples/goldbach_1000.js` is a specialized JavaScript derivation program. For ordinary sources, `see.js` emits the source facts as `examples/input/goldbach_1000.trig`. For rules-only sources, generation can reuse an existing external evidence file such as `examples/input/goldbach-1000.trig` or `examples/input/goldbach_1000.trig`. The runner reads that TriG evidence directly and performs a local fixpoint derivation; it does not parse the program source or call an external reasoner.
-
-## Output model
-
-Running `node examples/goldbach_1000.js` produces a SEE-style Markdown report with an **Entailment** section, an **Explanation** section, and a **Formal TriG Output** section containing the selected derived/query facts.

package/see/examples/doc/good_cobbler.md

@@ -1,27 +0,0 @@
-# Good cobbler
-
-Generated by `see.js` from a Notation3 source file.
-
-Example from https://shs.hal.science/halshs-04148373/document
-Using term logic http://intrologic.stanford.edu/chapters/chapter_11.html
-
-## Compilation summary
-
-- Example name: `good_cobbler`
-- Input facts emitted: 1
-- Forward rules compiled: 1
-- Backward predicate rules compiled: 0
-- Fuses compiled: 0
-- Predicate count: 1
-
-## Built-ins used
-
-- none
-
-## Runtime model
-
-The generated `examples/good_cobbler.js` is a specialized JavaScript derivation program. For ordinary sources, `see.js` emits the source facts as `examples/input/good_cobbler.trig`. For rules-only sources, generation can reuse an existing external evidence file such as `examples/input/good-cobbler.trig` or `examples/input/good_cobbler.trig`. The runner reads that TriG evidence directly and performs a local fixpoint derivation; it does not parse the program source or call an external reasoner.
-
-## Output model
-
-Running `node examples/good_cobbler.js` produces a SEE-style Markdown report with an **Entailment** section, an **Explanation** section, and a **Formal TriG Output** section containing the selected derived/query facts.

package/see/examples/doc/gps.md

@@ -1,35 +0,0 @@
-# GPS route planning
-
-Generated by `see.js` from a Notation3 source file.
-
-Goal-driven path planning over a tiny western-Belgium map. The N3 source is
-adapted from Eyeling's GPS example and compiles to a standalone SEE example.
-
-## Compilation summary
-
-- Example name: `gps`
-- Input facts emitted: 8
-- Forward rules compiled: 5
-- Backward predicate rules compiled: 2
-- Fuses compiled: 4
-- Predicate count: 21
-
-## Built-ins used
-
-- `list:append`
-- `log:outputString`
-- `math:greaterThan`
-- `math:lessThan`
-- `math:notGreaterThan`
-- `math:notLessThan`
-- `math:product`
-- `math:sum`
-- `string:format`
-
-## Runtime model
-
-The generated `examples/gps.js` is a specialized JavaScript derivation program. For ordinary sources, `see.js` emits the source facts as `examples/input/gps.trig`. For rules-only sources, generation can reuse an existing external evidence file such as `examples/input/gps.trig` or `examples/input/gps.trig`. The runner reads that TriG evidence directly and performs a local fixpoint derivation; it does not parse the program source or call an external reasoner.
-
-## Output model
-
-Running `node examples/gps.js` produces a SEE-style Markdown report with an **Entailment** section, an **Explanation** section, and a **Formal TriG Output** section containing the selected derived/query facts.

package/see/examples/doc/gray_code_counter.md

@@ -1,31 +0,0 @@
-# Gray Code Counter
-
-Generated by `see.js` from a Notation3 source file.
-
-N3-compiled version of the 4-bit Gray counter SEE example.  The example keeps
-the known reflected Gray-code sequence as data, derives its visited-state count
-with a list builtin, and derives the published invariants before rendering the
-SEE report.
-
-## Compilation summary
-
-- Example name: `gray_code_counter`
-- Input facts emitted: 7
-- Forward rules compiled: 3
-- Backward predicate rules compiled: 0
-- Fuses compiled: 0
-- Predicate count: 12
-
-## Built-ins used
-
-- `list:length`
-- `log:outputString`
-- `string:format`
-
-## Runtime model
-
-The generated `examples/gray_code_counter.js` is a specialized JavaScript derivation program. For ordinary sources, `see.js` emits the source facts as `examples/input/gray_code_counter.trig`. For rules-only sources, generation can reuse an existing external evidence file such as `examples/input/gray-code-counter.trig` or `examples/input/gray_code_counter.trig`. The runner reads that TriG evidence directly and performs a local fixpoint derivation; it does not parse the program source or call an external reasoner.
-
-## Output model
-
-Running `node examples/gray_code_counter.js` produces a SEE-style Markdown report with an **Entailment** section, an **Explanation** section, and a **Formal TriG Output** section containing the selected derived/query facts.

package/see/examples/doc/greatest_lower_bound_uniqueness.md

@@ -1,24 +0,0 @@
-# In a partial order, a greatest lower bound is unique.
-
-Generated by `see.js` from a Notation3 source file.
-
-## Compilation summary
-
-- Example name: `greatest_lower_bound_uniqueness`
-- Input facts emitted: 6
-- Forward rules compiled: 7
-- Backward predicate rules compiled: 0
-- Fuses compiled: 0
-- Predicate count: 8
-
-## Built-ins used
-
-- `log:notEqualTo`
-
-## Runtime model
-
-The generated `examples/greatest_lower_bound_uniqueness.js` is a specialized JavaScript derivation program. For ordinary sources, `see.js` emits the source facts as `examples/input/greatest_lower_bound_uniqueness.trig`. For rules-only sources, generation can reuse an existing external evidence file such as `examples/input/greatest-lower-bound-uniqueness.trig` or `examples/input/greatest_lower_bound_uniqueness.trig`. The runner reads that TriG evidence directly and performs a local fixpoint derivation; it does not parse the program source or call an external reasoner.
-
-## Output model
-
-Running `node examples/greatest_lower_bound_uniqueness.js` produces a SEE-style Markdown report with an **Entailment** section, an **Explanation** section, and a **Formal TriG Output** section containing the selected derived/query facts.

package/see/examples/doc/group_inverse_uniqueness.md

@@ -1,24 +0,0 @@
-# In a group, the inverse of an element is unique.
-
-Generated by `see.js` from a Notation3 source file.
-
-## Compilation summary
-
-- Example name: `group_inverse_uniqueness`
-- Input facts emitted: 6
-- Forward rules compiled: 6
-- Backward predicate rules compiled: 0
-- Fuses compiled: 0
-- Predicate count: 6
-
-## Built-ins used
-
-- `log:notEqualTo`
-
-## Runtime model
-
-The generated `examples/group_inverse_uniqueness.js` is a specialized JavaScript derivation program. For ordinary sources, `see.js` emits the source facts as `examples/input/group_inverse_uniqueness.trig`. For rules-only sources, generation can reuse an existing external evidence file such as `examples/input/group-inverse-uniqueness.trig` or `examples/input/group_inverse_uniqueness.trig`. The runner reads that TriG evidence directly and performs a local fixpoint derivation; it does not parse the program source or call an external reasoner.
-
-## Output model
-
-Running `node examples/group_inverse_uniqueness.js` produces a SEE-style Markdown report with an **Entailment** section, an **Explanation** section, and a **Formal TriG Output** section containing the selected derived/query facts.

package/see/examples/doc/hadamard_approx.md

@@ -1,32 +0,0 @@
-# Hadamard gate approximation
-
-Generated by `see.js` from a Notation3 source file.
-
-## Compilation summary
-
-- Example name: `hadamard_approx`
-- Input facts emitted: 8
-- Forward rules compiled: 10
-- Backward predicate rules compiled: 0
-- Fuses compiled: 0
-- Predicate count: 39
-
-## Built-ins used
-
-- `math:difference`
-- `math:equalTo`
-- `math:exponentiation`
-- `math:lessThan`
-- `math:notGreaterThan`
-- `math:notLessThan`
-- `math:product`
-- `math:quotient`
-- `math:sum`
-
-## Runtime model
-
-The generated `examples/hadamard_approx.js` is a specialized JavaScript derivation program. For ordinary sources, `see.js` emits the source facts as `examples/input/hadamard_approx.trig`. For rules-only sources, generation can reuse an existing external evidence file such as `examples/input/hadamard-approx.trig` or `examples/input/hadamard_approx.trig`. The runner reads that TriG evidence directly and performs a local fixpoint derivation; it does not parse the program source or call an external reasoner.
-
-## Output model
-
-Running `node examples/hadamard_approx.js` produces a SEE-style Markdown report with an **Entailment** section, an **Explanation** section, and a **Formal TriG Output** section containing the selected derived/query facts.

package/see/examples/doc/hanoi.md

@@ -1,26 +0,0 @@
-# Towers of Hanoi
-
-Generated by `see.js` from a Notation3 source file.
-
-## Compilation summary
-
-- Example name: `hanoi`
-- Input facts emitted: 0
-- Forward rules compiled: 1
-- Backward predicate rules compiled: 2
-- Fuses compiled: 0
-- Predicate count: 5
-
-## Built-ins used
-
-- `list:append`
-- `math:difference`
-- `math:greaterThan`
-
-## Runtime model
-
-The generated `examples/hanoi.js` is a specialized JavaScript derivation program. For ordinary sources, `see.js` emits the source facts as `examples/input/hanoi.trig`. For rules-only sources, generation can reuse an existing external evidence file such as `examples/input/hanoi.trig` or `examples/input/hanoi.trig`. The runner reads that TriG evidence directly and performs a local fixpoint derivation; it does not parse the program source or call an external reasoner.
-
-## Output model
-
-Running `node examples/hanoi.js` produces a SEE-style Markdown report with an **Entailment** section, an **Explanation** section, and a **Formal TriG Output** section containing the selected derived/query facts.

package/see/examples/doc/odrl_dpv_risk_ranked.md

@@ -1,57 +0,0 @@
-# ODRL + DPV risk assessment with ranked, explainable output.
-
-Generated by `see.js` from a Notation3 source file.
-
-What this file does
-- Models an agreement as an ODRL policy (odrl:Policy) containing permissions,
-prohibitions, duties, and constraints. ODRL is expressive enough to encode the
-normative “may/must/must-not” structure of TOS clauses as RDF.
-- Links each ODRL rule to a clause resource (:Clause) to keep human-readable text
-while preserving machine-readable structure for reasoning.
-- Uses N3 rules with log:includes / log:notIncludes to detect missing safeguards
-(e.g., missing notice constraints, missing inform duties, missing consent constraints).
-- Generates DPV risks (dpv:Risk) and classifies them using DPV-RISK concepts:
-risk:hasRiskSource, dpv:hasConsequence, dpv:hasImpact, dpv:hasSeverity, dpv:hasRiskLevel.
-- Produces mitigations as dpv:RiskMitigationMeasure resources and attaches them
-to risks with dpv:isMitigatedByMeasure.
-- Computes a numeric score for each risk and prints a ranked, explainable report.
-Ranking / output
-- Output strings are emitted as log:outputString triples.
-- When running with Eyeling “strings” mode (-r), strings are printed in deterministic
-order based on their subject key. The program encodes ranking via an “inverse score”
-key (e.g., 1000 - score) so higher-risk items appear first.
-References
-- N3 spec:          https://w3c.github.io/N3/spec/
-- Eyeling builtins: https://eyereasoner.github.io/eyeling/HANDBOOK#ch11
-- ODRL vocab:       https://www.w3.org/TR/odrl-vocab/
-- DPV risk module:  https://dev.dpvcg.org/dpv/modules/risk
-- DPV-RISK:         https://w3id.org/dpv/risk
-
-## Compilation summary
-
-- Example name: `odrl_dpv_risk_ranked`
-- Input facts emitted: 38
-- Forward rules compiled: 9
-- Backward predicate rules compiled: 0
-- Fuses compiled: 0
-- Predicate count: 32
-
-## Built-ins used
-
-- `log:includes`
-- `log:notIncludes`
-- `log:outputString`
-- `math:difference`
-- `math:greaterThan`
-- `math:lessThan`
-- `math:notLessThan`
-- `math:sum`
-- `string:format`
-
-## Runtime model
-
-The generated `examples/odrl_dpv_risk_ranked.js` is a specialized JavaScript derivation program. For ordinary sources, `see.js` emits the source facts as `examples/input/odrl_dpv_risk_ranked.trig`. For rules-only sources, generation can reuse an existing external evidence file such as `examples/input/odrl-dpv-risk-ranked.trig` or `examples/input/odrl_dpv_risk_ranked.trig`. The runner reads that TriG evidence directly and performs a local fixpoint derivation; it does not parse the program source or call an external reasoner.
-
-## Output model
-
-Running `node examples/odrl_dpv_risk_ranked.js` produces a SEE-style Markdown report with an **Entailment** section, an **Explanation** section, and a **Formal TriG Output** section containing the selected derived/query facts.