eyeling 1.24.4 → 1.24.6

package/see/README.md

@@ -1,149 +0,0 @@
-# SEE
-
-**Specialized Eyeling Executables**
-
-SEE (**Specialized Eyeling Executables**) is a small compiler and example suite for turning Eyeling-style Notation3 programs into specialized JavaScript executables with human-readable explanations.
-
-```text
-input facts -> rules -> trust gate -> entailment + explanation
-```
-
-Each example starts from a Notation3 source and is compiled by `see.js` into a small Node.js program:
-
-- `examples/n3/<name>.n3` contains the N3 facts, rules, gates, and query.
-- `examples/input/<name>.trig` contains the formal RDF 1.2 TriG input evidence read by the runner.
-- `examples/<name>.js` is generated by `see.js` and derives the entailment.
-- `examples/output/<name>.md` is the reference Markdown output used by `npm run test:see`.
-- `examples/doc/<name>.md` explains the compiled example.
-
-The trust gate is executable verification. If a required fact is missing, the program fails instead of emitting an unsupported entailment.
-
-The `triple_terms` and `rdf_dataset` examples use RDF 1.2 `<<( ... )>>` triple-term syntax. Eyeling accepts that syntax only with `-r, --rdf`, where it normalizes triple terms to existing N3 singleton graph terms `{ ... }` and prints feasible output graph terms back as RDF 1.2 triple terms. The `rdf_dataset` example also uses an RDF/TriG named graph block, which RDF compatibility mode normalizes to the N3 `log:nameOf { ... }` graph-term shape and prints back as a TriG named graph block where feasible; SEE keeps the committed `.trig` input and formal output in RDF 1.2/TriG form.
-
-
-## Run
-
-Run all examples:
-
-```sh
-npm run test:see
-```
-
-Render one N3 example through `see.js` without writing files:
-
-```sh
-node see/see.js render see/examples/n3/delfour.n3
-```
-
-Refresh the four committed SEE artefacts for one N3 example:
-
-```sh
-node see/see.js generate see/examples/n3/delfour.n3 --force
-```
-
-Compare one rendered output:
-
-```sh
-node see/examples/bmi.js > /tmp/bmi.md
-diff -u see/examples/output/bmi.md /tmp/bmi.md
-```
-
-
-## Compile a Notation3 example into SEE JavaScript
-
-`see.js` is a small Notation3-to-JavaScript compiler. It parses a supported N3 subset once and writes a specialized Node.js example. The `examples/<name>.js` generated by `see.js` does the derivation itself: it loads generated TriG evidence from `examples/input/<name>.trig`, contains compiled rules, fuses, built-in operations, fixpoint evaluation, and report rendering. It does not parse the program source at runtime and does not shell out to Eyeling or EYE.
-
-Generate the four SEE artefacts from an N3 source:
-
-```sh
-node see/see.js generate path/to/example.n3 --name my_example
-```
-
-During generation, `see.js` writes the specialized runner and TriG input evidence first, then invokes the compiled runner with `--write`. That generated `examples/<name>.js` is responsible for producing both `examples/output/<name>.md` and `examples/doc/<name>.md`.
-
-Render an N3 source without writing files:
-
-```sh
-node see/see.js render path/to/example.n3
-```
-
-Validate that the source is inside the supported compiler subset:
-
-```sh
-node see/see.js inspect path/to/example.n3
-```
-
-The compiler currently supports ordinary triples, semicolon/comma property lists, RDF lists, blank nodes, variable predicates, formula-valued conclusions, forward rules, recursive backward rules (`<=`), top-level `log:query`, `=> false` fuses, and a broad native builtin registry for Eyeling-style `math:`, `string:`, `list:`, `crypto:`, `time:`, and `log:` predicates. The compiled JavaScript covers multi-solution predicates such as `list:member`, `list:in`, `list:iterate`, `list:memberAt`, and `list:map`, plus relation-like reverse modes such as `math:exponentiation`, unary trig/degree relations, `list:reverse`, and `list:append` splitting. Offline dereferencing/parsing builtins (`log:content`, `log:semantics`, `log:semanticsOrError`, `log:parsedAsN3`) fail explicitly in compiled SEE examples instead of doing network or parser work at runtime. Unsupported constructs fail rather than jumping directly to a prewritten `log:outputString`. When no authored `log:outputString` report is derived, the compiled runner still emits a SEE-style report with just **Entailment** and **Explanation** sections instead of dumping the whole graph; supporting facts are folded into the explanation, including concise support trees that trace selected entailments back to source facts when the compiler has rule-premise evidence available.
-
-## Files
-
-```text
-examples/
-  <name>.js             executable example
-  _see.js               shared helper
-  input/<name>.trig     formal RDF 1.2 TriG evidence
-  output/<name>.md      reference entailment and explanation
-  doc/<name>.md         guide
-  n3/<name>.n3          Notation3 source
-```
-
-## Current examples
-
-The repository currently contains **50 N3-compiled SEE examples**. Each example has a Notation3 source, an executable `examples/<name>.js`, TriG input evidence, a reference output, and a documentation page. `node see/see.js generate ... --force` regenerates individual examples from files under `see/examples/n3/`.
-
-### N3-compiled SEE examples
-
-| Example | Idea | Files |
-|---|---|---|
-| <a id="example-age-threshold"></a>[Age threshold](#example-age-threshold) | compiled from Notation3 by `see.js`; date/duration comparison evaluates whether a person is older than a configured age threshold. | [doc](examples/doc/age.md), [js](examples/age.js), [input](examples/input/age.trig), [output](examples/output/age.md), [n3](examples/n3/age.n3) |
-| <a id="example-annotation"></a>[Annotation](#example-annotation) | compiled from Notation3 by `see.js`; formula-valued annotation data with `log:nameOf` and typed literals. | [doc](examples/doc/annotation.md), [js](examples/annotation.js), [input](examples/input/annotation.trig), [output](examples/output/annotation.md), [n3](examples/n3/annotation.n3) |
-| <a id="example-backward-rule-example"></a>[Backward rule example](#example-backward-rule-example) | compiled from Notation3 by `see.js`; Eyeling backward-rule example with a `math:greaterThan` guard. | [doc](examples/doc/backward.md), [js](examples/backward.js), [input](examples/input/backward.trig), [output](examples/output/backward.md), [n3](examples/n3/backward.n3) |
-| <a id="example-backward-recursion-coverage"></a>[Backward recursion coverage](#example-backward-recursion-coverage) | compiled from Notation3 by `see.js`; recursive `<=` ancestor rules compiled into JavaScript goal solving. | [doc](examples/doc/backward_recursion.md), [js](examples/backward_recursion.js), [input](examples/input/backward_recursion.trig), [output](examples/output/backward_recursion.md), [n3](examples/n3/backward_recursion.n3) |
-| <a id="example-bayes-diagnosis"></a>[Bayes diagnosis](#example-bayes-diagnosis) | compiled from Notation3 by `see.js`; Naive Bayes evidence factors are multiplied, normalized, and compared to select the highest-posterior disease. | [doc](examples/doc/bayes_diagnosis.md), [js](examples/bayes_diagnosis.js), [input](examples/input/bayes_diagnosis.trig), [output](examples/output/bayes_diagnosis.md), [n3](examples/n3/bayes_diagnosis.n3) |
-| <a id="example-bayes-therapy"></a>[Bayes therapy](#example-bayes-therapy) | compiled from Notation3 by `see.js`; Bayesian disease posteriors feed a therapy expected-utility calculation with recursive best-therapy selection. | [doc](examples/doc/bayes_therapy.md), [js](examples/bayes_therapy.js), [input](examples/input/bayes_therapy.trig), [output](examples/output/bayes_therapy.md), [n3](examples/n3/bayes_therapy.n3) |
-| <a id="example-bmi"></a>[BMI](#example-bmi) | compiled from Notation3 by `see.js`; unit normalization, BMI category selection, and healthy-weight range validations are derived from N3 rules. | [doc](examples/doc/bmi.md), [js](examples/bmi.js), [input](examples/input/bmi.trig), [output](examples/output/bmi.md), [n3](examples/n3/bmi.n3) |
-| <a id="example-builtin-coverage-smoke"></a>[Builtin coverage smoke](#example-builtin-coverage-smoke) | compiled from Notation3 by `see.js`; smoke test for compiled math, string, list, crypto, time, and log builtins. | [doc](examples/doc/builtin_coverage.md), [js](examples/builtin_coverage.js), [input](examples/input/builtin_coverage.trig), [output](examples/output/builtin_coverage.md), [n3](examples/n3/builtin_coverage.n3) |
-| <a id="example-collection"></a>[Collection](#example-collection) | compiled from Notation3 by `see.js`; RDF collection/list data with a blank node inside the list. | [doc](examples/doc/collection.md), [js](examples/collection.js), [input](examples/input/collection.trig), [output](examples/output/collection.md), [n3](examples/n3/collection.n3) |
-| <a id="example-complex-numbers"></a>[Complex numbers](#example-complex-numbers) | compiled from Notation3 by `see.js`; complex arithmetic rules and formula-valued entailment. | [doc](examples/doc/complex.md), [js](examples/complex.js), [input](examples/input/complex.trig), [output](examples/output/complex.md), [n3](examples/n3/complex.n3) |
-| <a id="example-complex-matrix-stability"></a>[Complex matrix stability](#example-complex-matrix-stability) | compiled from Notation3 by `see.js`; diagonal 2x2 complex matrices are classified from squared eigenvalue moduli, with complex product and scaling validations. | [doc](examples/doc/complex_matrix_stability.md), [js](examples/complex_matrix_stability.js), [input](examples/input/complex_matrix_stability.trig), [output](examples/output/complex_matrix_stability.md), [n3](examples/n3/complex_matrix_stability.n3) |
-| <a id="example-composition-of-injective-functions"></a>[Composition of injective functions](#example-composition-of-injective-functions) | compiled from Notation3 by `see.js`; proof-style rules show that the composition of injective functions is injective. | [doc](examples/doc/composition_of_injective_functions_is_injective.md), [js](examples/composition_of_injective_functions_is_injective.js), [input](examples/input/composition_of_injective_functions_is_injective.trig), [output](examples/output/composition_of_injective_functions_is_injective.md), [n3](examples/n3/composition_of_injective_functions_is_injective.n3) |
-| <a id="example-control-system"></a>[Control system](#example-control-system) | compiled from Notation3 by `see.js`; compact EYE-style sensor, disturbance, and target facts derive two actuator commands. | [doc](examples/doc/control_system.md), [js](examples/control_system.js), [input](examples/input/control_system.trig), [output](examples/output/control_system.md), [n3](examples/n3/control_system.n3) |
-| <a id="example-crypto-builtin-tests"></a>[Crypto builtin tests](#example-crypto-builtin-tests) | compiled from Notation3 by `see.js`; SHA-1, MD5, SHA-256, and SHA-512 builtin validations become pass facts. | [doc](examples/doc/crypto_builtins_tests.md), [js](examples/crypto_builtins_tests.js), [input](examples/input/crypto_builtins_tests.trig), [output](examples/output/crypto_builtins_tests.md), [n3](examples/n3/crypto_builtins_tests.n3) |
-| <a id="example-dijkstra-shortest-path"></a>[Dijkstra shortest path](#example-dijkstra-shortest-path) | compiled from Notation3 by `see.js`; list, collection, sorting, and recursive backward rules derive the shortest path from `:a` to `:f`. | [doc](examples/doc/dijkstra.md), [js](examples/dijkstra.js), [input](examples/input/dijkstra.trig), [output](examples/output/dijkstra.md), [n3](examples/n3/dijkstra.n3) |
-| <a id="example-dijkstra-risk-path"></a>[Dijkstra risk path](#example-dijkstra-risk-path) | compiled from Notation3 by `see.js`; risk-adjusted route selection derives the best path from edge costs, route risk, and threshold rules. | [doc](examples/doc/dijkstra_risk_path.md), [js](examples/dijkstra_risk_path.js), [input](examples/input/dijkstra_risk_path.trig), [output](examples/output/dijkstra_risk_path.md), [n3](examples/n3/dijkstra_risk_path.n3) |
-| <a id="example-dog-license-example"></a>[Dog license example](#example-dog-license-example) | compiled from Notation3 by `see.js`; `log:collectAllIn` and `math:sum` derive that a multi-dog household needs a license. | [doc](examples/doc/dog.md), [js](examples/dog.js), [input](examples/input/dog.trig), [output](examples/output/dog.md), [n3](examples/n3/dog.n3) |
-| <a id="example-eco-route-insight"></a>[Eco route entailment](#example-eco-route-insight) | compiled from Notation3 by `see.js`; privacy-preserving route evidence derives an eco-route recommendation with signed-envelope explanation data. | [doc](examples/doc/eco_route_insight.md), [js](examples/eco_route_insight.js), [input](examples/input/eco_route_insight.trig), [output](examples/output/eco_route_insight.md), [n3](examples/n3/eco_route_insight.n3) |
-| <a id="example-delfour"></a>[Delfour](#example-delfour) | compiled from Notation3 by `see.js`; scoped policy facts, cryptographic hash validation, and product rules authorize a lower-sugar scanner recommendation. | [doc](examples/doc/delfour.md), [js](examples/delfour.js), [input](examples/input/delfour.trig), [output](examples/output/delfour.md), [n3](examples/n3/delfour.n3) |
-| <a id="example-digital-product-passport"></a>[Digital product passport](#example-digital-product-passport) | compiled from Notation3 by `see.js`; component, document, access-policy, and footprint facts fold into a public passport PASS decision. | [doc](examples/doc/digital_product_passport.md), [js](examples/digital_product_passport.js), [input](examples/input/digital_product_passport.trig), [output](examples/output/digital_product_passport.md), [n3](examples/n3/digital_product_passport.n3) |
-| <a id="example-equals-test"></a>[Equals test](#example-equals-test) | compiled from Notation3 by `see.js`; N3 `=` / `owl:sameAs` shorthand compiled into a normal derivation. | [doc](examples/doc/equals.md), [js](examples/equals.js), [input](examples/input/equals.trig), [output](examples/output/equals.md), [n3](examples/n3/equals.n3) |
-| <a id="example-equivalence-class-overlap"></a>[Equivalence class overlap](#example-equivalence-class-overlap) | compiled from Notation3 by `see.js`; equivalence-relation closure proves overlapping equivalence classes are the same class. | [doc](examples/doc/equivalence_classes_overlap_implies_same_class.md), [js](examples/equivalence_classes_overlap_implies_same_class.js), [input](examples/input/equivalence_classes_overlap_implies_same_class.trig), [output](examples/output/equivalence_classes_overlap_implies_same_class.md), [n3](examples/n3/equivalence_classes_overlap_implies_same_class.n3) |
-| <a id="example-euler-identity"></a>[Euler identity](#example-euler-identity) | compiled from Notation3 by `see.js`; exact integer-style certificate for exp(i*pi) + 1 = 0 with `log:query` projection. | [doc](examples/doc/euler_identity.md), [js](examples/euler_identity.js), [input](examples/input/euler_identity.trig), [output](examples/output/euler_identity.md), [n3](examples/n3/euler_identity.n3) |
-| <a id="example-ev-roadtrip-planner"></a>[EV roadtrip planner](#example-ev-roadtrip-planner) | compiled from Notation3 by `see.js`; EV route candidates are evaluated against belief, cost, duration, and fuel thresholds before selecting the fastest acceptable plan. | [doc](examples/doc/ev_roundtrip_planner.md), [js](examples/ev_roundtrip_planner.js), [input](examples/input/ev_roundtrip_planner.trig), [output](examples/output/ev_roundtrip_planner.md), [n3](examples/n3/ev_roundtrip_planner.n3) |
-| <a id="example-existential-rule"></a>[Existential rule](#example-existential-rule) | compiled from Notation3 by `see.js`; rule-head blank nodes compile into deterministic existential witnesses. | [doc](examples/doc/existential_rule.md), [js](examples/existential_rule.js), [input](examples/input/existential_rule.trig), [output](examples/output/existential_rule.md), [n3](examples/n3/existential_rule.n3) |
-| <a id="example-expression-evaluator"></a>[Expression evaluator](#example-expression-evaluator) | compiled from Notation3 by `see.js`; recursive backward rules evaluate `(2 * 3) + (10 - 4)`. | [doc](examples/doc/expression_eval.md), [js](examples/expression_eval.js), [input](examples/input/expression_eval.trig), [output](examples/output/expression_eval.md), [n3](examples/n3/expression_eval.n3) |
-| <a id="example-family-cousins"></a>[Family cousins](#example-family-cousins) | compiled from Notation3 by `see.js`; family-tree rules derive cousin relationships from parent facts. | [doc](examples/doc/family_cousins.md), [js](examples/family_cousins.js), [input](examples/input/family_cousins.trig), [output](examples/output/family_cousins.md), [n3](examples/n3/family_cousins.n3) |
-| <a id="example-fast-exponentiation"></a>[Fast exponentiation](#example-fast-exponentiation) | compiled from Notation3 by `see.js`; exponentiation, remainder, and recursive backward rules compute fast powers and power towers. | [doc](examples/doc/fastpow.md), [js](examples/fastpow.js), [input](examples/input/fastpow.trig), [output](examples/output/fastpow.md), [n3](examples/n3/fastpow.n3) |
-| <a id="example-fibonacci-big"></a>[Fibonacci example big](#example-fibonacci-big) | compiled from Notation3 by `see.js`; exact Fibonacci target and sample indices are represented as formal TriG evidence and reported through generated rules. | [doc](examples/doc/fibonacci.md), [js](examples/fibonacci.js), [input](examples/input/fibonacci.trig), [output](examples/output/fibonacci.md), [n3](examples/n3/fibonacci.n3) |
-| <a id="example-french-cities"></a>[French cities](#example-french-cities) | compiled from Notation3 by `see.js`; compact graph path traversal with subproperty and transitive-property closure, based on EYE `reasoning/graph`. | [doc](examples/doc/french_cities.md), [js](examples/french_cities.js), [input](examples/input/french_cities.trig), [output](examples/output/french_cities.md), [n3](examples/n3/french_cities.n3) |
-| <a id="example-fundamental-theorem-arithmetic"></a>[Fundamental theorem arithmetic](#example-fundamental-theorem-arithmetic) | compiled from Notation3 by `see.js`; primary factorization is validated by product reconstruction, reverse-order sorting, and prime witnesses, with sample summaries retained as data. | [doc](examples/doc/fundamental_theorem_arithmetic.md), [js](examples/fundamental_theorem_arithmetic.js), [input](examples/input/fundamental_theorem_arithmetic.trig), [output](examples/output/fundamental_theorem_arithmetic.md), [n3](examples/n3/fundamental_theorem_arithmetic.n3) |
-| <a id="example-genetic-knapsack-selection"></a>[Genetic knapsack selection](#example-genetic-knapsack-selection) | compiled from Notation3 by `see.js`; deterministic one-bit mutation candidates are scored against knapsack capacity and value constraints. | [doc](examples/doc/genetic_knapsack_selection.md), [js](examples/genetic_knapsack_selection.js), [input](examples/input/genetic_knapsack_selection.trig), [output](examples/output/genetic_knapsack_selection.md), [n3](examples/n3/genetic_knapsack_selection.n3) |
-| <a id="example-goldbach-1000"></a>[Goldbach 1000](#example-goldbach-1000) | compiled from Notation3 by `see.js`; bounded Goldbach run data is validated through representative prime-sum witnesses and a zero-counterexample condition. | [doc](examples/doc/goldbach_1000.md), [js](examples/goldbach_1000.js), [input](examples/input/goldbach_1000.trig), [output](examples/output/goldbach_1000.md), [n3](examples/n3/goldbach_1000.n3) |
-| <a id="example-good-cobbler"></a>[Good cobbler](#example-good-cobbler) | compiled from Notation3 by `see.js`; term-logic-style list pattern and formula-valued entailment. | [doc](examples/doc/good_cobbler.md), [js](examples/good_cobbler.js), [input](examples/input/good_cobbler.trig), [output](examples/output/good_cobbler.md), [n3](examples/n3/good_cobbler.n3) |
-| <a id="example-gps-route-planning"></a>[GPS route planning](#example-gps-route-planning) | compiled from Notation3 by `see.js`; recursive path rules compare western-Belgium routes by duration, cost, belief, and comfort. | [doc](examples/doc/gps.md), [js](examples/gps.js), [input](examples/input/gps.trig), [output](examples/output/gps.md), [n3](examples/n3/gps.n3) |
-| <a id="example-gray-code-counter"></a>[Gray code counter](#example-gray-code-counter) | compiled from Notation3 by `see.js`; a 4-bit reflected Gray-code cycle is validated as a complete one-bit-transition sequence. | [doc](examples/doc/gray_code_counter.md), [js](examples/gray_code_counter.js), [input](examples/input/gray_code_counter.trig), [output](examples/output/gray_code_counter.md), [n3](examples/n3/gray_code_counter.n3) |
-| <a id="example-greatest-lower-bound-uniqueness"></a>[Greatest lower bound uniqueness](#example-greatest-lower-bound-uniqueness) | compiled from Notation3 by `see.js`; partial-order rules prove two greatest lower bounds of the same pair coincide. | [doc](examples/doc/greatest_lower_bound_uniqueness.md), [js](examples/greatest_lower_bound_uniqueness.js), [input](examples/input/greatest_lower_bound_uniqueness.trig), [output](examples/output/greatest_lower_bound_uniqueness.md), [n3](examples/n3/greatest_lower_bound_uniqueness.n3) |
-| <a id="example-group-inverse-uniqueness"></a>[Group inverse uniqueness](#example-group-inverse-uniqueness) | compiled from Notation3 by `see.js`; group-law rules derive uniqueness of an inverse element. | [doc](examples/doc/group_inverse_uniqueness.md), [js](examples/group_inverse_uniqueness.js), [input](examples/input/group_inverse_uniqueness.trig), [output](examples/output/group_inverse_uniqueness.md), [n3](examples/n3/group_inverse_uniqueness.n3) |
-| <a id="example-hadamard-approximation"></a>[Hadamard approximation](#example-hadamard-approximation) | compiled from Notation3 by `see.js`; dyadic integer bounds certify a Hadamard-gate approximation and project selected results with `log:query`. | [doc](examples/doc/hadamard_approx.md), [js](examples/hadamard_approx.js), [input](examples/input/hadamard_approx.trig), [output](examples/output/hadamard_approx.md), [n3](examples/n3/hadamard_approx.n3) |
-| <a id="example-towers-of-hanoi"></a>[Towers of Hanoi](#example-towers-of-hanoi) | compiled from Notation3 by `see.js`; recursive backward rules and list append produce the three-disk move sequence. | [doc](examples/doc/hanoi.md), [js](examples/hanoi.js), [input](examples/input/hanoi.trig), [output](examples/output/hanoi.md), [n3](examples/n3/hanoi.n3) |
-| <a id="example-odrl-dpv-risk-ranking"></a>[ODRL + DPV risk ranking](#example-odrl-dpv-risk-ranking) | compiled from Notation3 by `see.js`; policy and data-protection evidence are ranked by risk level and selected through rule-derived comparisons. | [doc](examples/doc/odrl_dpv_risk_ranked.md), [js](examples/odrl_dpv_risk_ranked.js), [input](examples/input/odrl_dpv_risk_ranked.trig), [output](examples/output/odrl_dpv_risk_ranked.md), [n3](examples/n3/odrl_dpv_risk_ranked.n3) |
-| <a id="example-path-discovery"></a>[Path discovery](#example-path-discovery) | compiled from the upstream path-discovery rules; the runner loads the full 96k-fact airroutes graph from TriG and evaluates the bounded route query with an indexed adjacency list. | [doc](examples/doc/path_discovery.md), [js](examples/path_discovery.js), [input](examples/input/path-discovery.trig), [output](examples/output/path_discovery.md), [n3](examples/n3/path_discovery.n3) |
-| <a id="example-rc-discharge-envelope"></a>[RC discharge envelope](#example-rc-discharge-envelope) | compiled from Notation3 by `see.js`; exponentiation over an upper decay bound certifies the first sampled capacitor step below tolerance. | [doc](examples/doc/rc_discharge_envelope.md), [js](examples/rc_discharge_envelope.js), [input](examples/input/rc_discharge_envelope.trig), [output](examples/output/rc_discharge_envelope.md), [n3](examples/n3/rc_discharge_envelope.n3) |
-| <a id="example-rdf-dataset-compatibility"></a>[RDF dataset compatibility](#example-rdf-dataset-compatibility) | compiled from Notation3 by `see.js`; RDF/TriG named graph input and RDF 1.2 triple terms demonstrate the same N3 graph-term normalization used by Eyeling's explicit RDF compatibility mode. | [doc](examples/doc/rdf_dataset.md), [js](examples/rdf_dataset.js), [input](examples/input/rdf_dataset.trig), [output](examples/output/rdf_dataset.md), [n3](examples/n3/rdf_dataset.n3) |
-| <a id="example-rdf-message-flow"></a>[RDF Message Flow](#example-rdf-message-flow) | compiled from Notation3 by `see.js`; live RDF Messages advance through ingest, validate, interpret, route, and sink stages, with each completed message releasing the next one. | [doc](examples/doc/rdf_message_flow.md), [js](examples/rdf_message_flow.js), [input](examples/input/rdf_message_flow.trig), [output](examples/output/rdf_message_flow.md), [n3](examples/n3/rdf_message_flow.n3) |
-| <a id="example-rdf-messages"></a>[RDF Messages](#example-rdf-messages) | compiled from Notation3 by `see.js`; ordered RDF Message Log example preserving explicit message boundaries, an empty heartbeat, message-local payloads, and reused blank-node labels. | [doc](examples/doc/rdf_messages.md), [js](examples/rdf_messages.js), [input](examples/input/rdf_messages.trig), [output](examples/output/rdf_messages.md), [n3](examples/n3/rdf_messages.n3) |
-| <a id="example-school-placement-route-audit"></a>[School placement route audit](#example-school-placement-route-audit) | compiled from Notation3 by `see.js`; student, school, distance, and policy facts derive an auditable school-placement route decision. | [doc](examples/doc/school_placement_audit.md), [js](examples/school_placement_audit.js), [input](examples/input/school_placement_audit.trig), [output](examples/output/school_placement_audit.md), [n3](examples/n3/school_placement_audit.n3) |
-| <a id="example-smoke-arithmetic"></a>[Smoke Arithmetic](#example-smoke-arithmetic) | compiled from Notation3 by `see.js`; arithmetic compiler smoke test deriving 6 × 7 through rules and builtins. | [doc](examples/doc/smoke_arithmetic.md), [js](examples/smoke_arithmetic.js), [input](examples/input/smoke_arithmetic.trig), [output](examples/output/smoke_arithmetic.md), [n3](examples/n3/smoke_arithmetic.n3) |
-| <a id="example-socrates-inference"></a>[Socrates inference](#example-socrates-inference) | compiled from Notation3 by `see.js`; subclass closure with top-level `log:query` projection. | [doc](examples/doc/socrates.md), [js](examples/socrates.js), [input](examples/input/socrates.trig), [output](examples/output/socrates.md), [n3](examples/n3/socrates.n3) |
-| <a id="example-triple-terms"></a>[Triple terms](#example-triple-terms) | compiled from Notation3 by `see.js`; RDF 1.2 TriG triple terms are used as input evidence and as a derived entailment. | [doc](examples/doc/triple_terms.md), [js](examples/triple_terms.js), [input](examples/input/triple_terms.trig), [output](examples/output/triple_terms.md), [n3](examples/n3/triple_terms.n3) |
-| <a id="example-wind-turbine-envelope"></a>[Wind turbine envelope](#example-wind-turbine-envelope) | compiled from Notation3 by `see.js`; wind-speed samples are classified against cut-in, rated, and cut-out thresholds and accumulated into energy. | [doc](examples/doc/wind_turbine.md), [js](examples/wind_turbine.js), [input](examples/input/wind_turbine.trig), [output](examples/output/wind_turbine.md), [n3](examples/n3/wind_turbine.n3) |
-| <a id="example-burn-the-witch"></a>[Burn the witch](#example-burn-the-witch) | compiled from Notation3 by `see.js`; rule-chain explanation for the witch entailment. | [doc](examples/doc/witch.md), [js](examples/witch.js), [input](examples/input/witch.trig), [output](examples/output/witch.md), [n3](examples/n3/witch.n3) |

package/see/examples/_see.js

@@ -1,249 +0,0 @@
-const fs = require('fs');
-const path = require('path');
-const INPUT_DIR = path.join(__dirname, 'input');
-
-function iri(value) { return { kind: 'iri', value }; }
-function lit(value) { return { kind: 'lit', value }; }
-function blank(value) { return { kind: 'blank', value }; }
-function list(items) { return { kind: 'list', items }; }
-function formula(atoms) { return { kind: 'formula', atoms }; }
-function triple(s, p, o) { return { kind: 'triple', s, p, o }; }
-
-function readTermToken(text, start = 0) {
-  let i = start;
-  while (/\s/.test(text[i])) i += 1;
-  const begin = i;
-  if (text.startsWith('<<(', i)) {
-    let depth = 0;
-    while (i < text.length) {
-      if (text[i] === '"') {
-        const [, next] = readTermToken(text, i);
-        i = next;
-        continue;
-      }
-      if (text.startsWith('<<(', i)) { depth += 1; i += 3; continue; }
-      if (text.startsWith(')>>', i)) {
-        depth -= 1;
-        i += 3;
-        if (depth === 0) break;
-        continue;
-      }
-      i += 1;
-    }
-    return [text.slice(begin, i), i];
-  }
-  if (text[i] === '"') {
-    i += 1;
-    let escaped = false;
-    while (i < text.length) {
-      const ch = text[i++];
-      if (escaped) { escaped = false; continue; }
-      if (ch === '\\') { escaped = true; continue; }
-      if (ch === '"') break;
-    }
-    return [text.slice(begin, i), i];
-  }
-  if (text[i] === '<') {
-    i += 1;
-    while (i < text.length && text[i] !== '>') i += 1;
-    if (text[i] === '>') i += 1;
-    return [text.slice(begin, i), i];
-  }
-  if (text[i] === '(') {
-    let depth = 0;
-    while (i < text.length) {
-      if (text[i] === '"') {
-        const [, next] = readTermToken(text, i);
-        i = next;
-        continue;
-      }
-      if (text[i] === '(') depth += 1;
-      else if (text[i] === ')') {
-        depth -= 1;
-        i += 1;
-        if (depth === 0) break;
-        continue;
-      }
-      i += 1;
-    }
-    return [text.slice(begin, i), i];
-  }
-  while (i < text.length && !/\s/.test(text[i])) i += 1;
-  return [text.slice(begin, i), i];
-}
-
-function stripDot(text) { return String(text || '').replace(/\s*\.\s*$/, '').trim(); }
-function splitListItems(text) {
-  const out = [];
-  let i = 0;
-  while (i < text.length) {
-    while (/\s/.test(text[i])) i += 1;
-    if (i >= text.length) break;
-    const start = i;
-    if (text.startsWith('<<(', i)) {
-      const [, next] = readTermToken(text, i);
-      i = next;
-    } else if (text[i] === '"') {
-      i += 1;
-      let escaped = false;
-      while (i < text.length) {
-        const ch = text[i++];
-        if (escaped) { escaped = false; continue; }
-        if (ch === '\\') { escaped = true; continue; }
-        if (ch === '"') break;
-      }
-    } else if (text[i] === '(') {
-      let depth = 1; i += 1;
-      while (i < text.length && depth) {
-        if (text[i] === '(') depth += 1;
-        else if (text[i] === ')') depth -= 1;
-        i += 1;
-      }
-    } else {
-      while (i < text.length && !/\s/.test(text[i])) i += 1;
-    }
-    out.push(text.slice(start, i));
-  }
-  return out;
-}
-function parseTripleTermBody(text) {
-  const [s, i1] = readTermToken(text, 0);
-  const [p, i2] = readTermToken(text, i1);
-  const [o, i3] = readTermToken(text, i2);
-  if (!s || !p || !o || text.slice(i3).trim()) throw new Error('bad triple term: ' + text);
-  return triple(parseTerm(s), parseTerm(p), parseTerm(o));
-}
-function parseTerm(text) {
-  const t = String(text || '').trim();
-  if (!t) throw new Error('empty term');
-  if (t.startsWith('<<(') && t.endsWith(')>>')) return parseTripleTermBody(t.slice(3, -3).trim());
-  const first = t[0];
-  if (first === '"') return lit(JSON.parse(t));
-  if (first === '(' && t[t.length - 1] === ')') return list(splitListItems(t.slice(1, -1)).map(parseTerm));
-  if (t.startsWith('_:')) return blank(t);
-  if (first !== '+' && first !== '-' && (first < '0' || first > '9')) {
-    if (t === 'true') return lit(true);
-    if (t === 'false') return lit(false);
-    return iri(t);
-  }
-  if (/^[+-]?\d+$/.test(t)) return lit(Number.parseInt(t, 10));
-  if (/^[+-]?(?:\d+\.\d*|\d*\.\d+|\d+[eE][+-]?\d+)$/.test(t)) return lit(Number(t));
-  return iri(t);
-}
-function parseTripleLine(line) {
-  const body = stripDot(line);
-  const [s, i1] = readTermToken(body, 0);
-  const [p, i2] = readTermToken(body, i1);
-  const rest = body.slice(i2).trim();
-  if (!s || !p || !rest) throw new Error('bad triple: ' + line);
-  return { s: parseTerm(s), p: parseTerm(p), o: parseTerm(rest) };
-}
-function parseInputTrigFast(trig) {
-  const facts = [];
-  const lines = String(trig || '').split(/\r?\n/);
-  for (let i = 0; i < lines.length; i += 1) {
-    const line = lines[i].trim();
-    if (!line || line.startsWith('#') || line.toLowerCase().startsWith('@prefix ') || /^(@version|version)\s+/i.test(line)) continue;
-    const graphStart = line.match(/^(\S+)\s*\{\s*$/);
-    if (graphStart) {
-      const atoms = [];
-      for (i += 1; i < lines.length; i += 1) {
-        const inner = lines[i].trim();
-        if (!inner || inner.startsWith('#')) continue;
-        if (/^}\s*\.?\s*$/.test(inner)) break;
-        atoms.push(parseTripleLine(inner));
-      }
-      facts.push({ s: parseTerm(graphStart[1]), p: iri('log:nameOf'), o: formula(atoms) });
-      continue;
-    }
-    if (line.includes('{') || line.includes('}')) throw new Error('unsupported inline formula');
-    facts.push(parseTripleLine(line));
-  }
-  return facts;
-}
-function extractMetadata(facts) {
-  const meta = {}, rem = [];
-  const map = {
-    'see:name': 'Name', 'see:title': 'Title', 'see:sourceFile': 'SourceFile',
-    'see:sourceSHA256': 'SourceSHA256', 'see:description': 'Description',
-    'see:compiler': 'Compiler', 'see:inputFacts': 'InputFacts',
-    'see:compiledRules': 'CompiledRules', 'see:compiledBackwardRules': 'CompiledBackwardRules',
-    'see:compiledFuses': 'CompiledFuses', 'see:compiledQueries': 'CompiledQueries'
-  };
-  for (const f of facts) {
-    if (f.s?.value === 'in:metadata' && f.p?.value === 'log:nameOf' && f.o?.kind === 'formula') {
-      for (const a of f.o.atoms || []) {
-        const k = map[a.p?.value];
-        if (k && a.o?.kind === 'lit') meta[k] = a.o.value;
-      }
-      continue;
-    }
-    rem.push(f);
-  }
-  return { meta, facts: rem };
-}
-function inflateFormulaLinks(facts) {
-  const by = new Map();
-  for (const f of facts) if (/^in:formula\d+$/.test(f.s?.value || '') && f.p?.value === 'log:nameOf' && f.o?.kind === 'formula') by.set(f.s.value, f.o);
-  if (!by.size) return facts;
-  const out = [];
-  for (const f of facts) {
-    if (by.has(f.s?.value || '') && f.p?.value === 'log:nameOf') continue;
-    if (by.has(f.o?.value || '')) { out.push({ ...f, o: by.get(f.o.value) }); continue; }
-    out.push(f);
-  }
-  return out;
-}
-function inputNameCandidates(name) {
-  const out = [name];
-  const dashed = name.replace(/_/g, '-');
-  if (!out.includes(dashed)) out.push(dashed);
-  return out;
-}
-function inputFactsFromTrigText(trig) {
-  const m = String(trig || '').match(/\bsee:inputFacts\s+([0-9]+)\s*\./);
-  return m ? Number.parseInt(m[1], 10) : null;
-}
-function inputCandidateScore(file) {
-  try {
-    const stat = fs.statSync(file);
-    const text = fs.readFileSync(file, 'utf8');
-    const facts = inputFactsFromTrigText(text);
-    return { facts: facts ?? -1, size: stat.size };
-  } catch (_) {
-    return { facts: -1, size: -1 };
-  }
-}
-function inputBase(name) {
-  const candidates = inputNameCandidates(name)
-    .map((base, order) => ({ base, order, file: path.join(INPUT_DIR, `${base}.trig`) }))
-    .filter((c) => fs.existsSync(c.file))
-    .map((c) => ({ ...c, score: inputCandidateScore(c.file) }));
-  if (!candidates.length) return name;
-  candidates.sort((a, b) =>
-    (b.score.facts - a.score.facts) ||
-    (b.score.size - a.score.size) ||
-    (a.order - b.order)
-  );
-  return candidates[0].base;
-}
-function parseInput(trig) { return parseInputTrigFast(trig); }
-function loadInput(name) {
-  const base = inputBase(name);
-  const trigFile = path.join(INPUT_DIR, `${base}.trig`);
-  const trig = fs.readFileSync(trigFile, 'utf8');
-  const ex = extractMetadata(parseInput(trig));
-  return { __see: ex.meta, facts: inflateFormulaLinks(ex.facts), trig };
-}
-function emit(l = '') { process.stdout.write(l ? `${l}  \n` : '\n'); }
-function emitLines(ls) { for (const l of ls) emit(l); }
-function fail(p, o) { const f = Object.entries(o).filter(([, ok]) => !ok).map(([n]) => n); if (f.length) throw new Error(`${p}: ${f.join(', ')}`); }
-function sum(v) { return v.reduce((a, b) => a + b, 0); }
-function compareKeys(a, b) { const aa = Array.isArray(a) ? a : [a], bb = Array.isArray(b) ? b : [b], n = Math.min(aa.length, bb.length); for (let i = 0; i < n; i += 1) { if (aa[i] < bb[i]) return -1; if (aa[i] > bb[i]) return 1; } return aa.length - bb.length; }
-function minBy(v, k) { let best = v[0], bk = k(best); for (let i = 1; i < v.length; i += 1) { const kk = k(v[i]); if (compareKeys(kk, bk) < 0) { best = v[i]; bk = kk; } } return best; }
-function maxBy(v, k) { let best = v[0], bk = k(best); for (let i = 1; i < v.length; i += 1) { const kk = k(v[i]); if (compareKeys(kk, bk) > 0) { best = v[i]; bk = kk; } } return best; }
-function range(start, stop, step = 1) { if (stop === undefined) { stop = start; start = 0; } const o = []; for (let i = start; step > 0 ? i < stop : i > stop; i += step) o.push(i); return o; }
-function roundTo(v, d = 0) { const f = 10 ** d; return Math.round((v + Number.EPSILON) * f) / f; }
-function boolText(v) { return v ? 'true' : 'false'; }
-
-module.exports = { loadInput, emit, emitLines, fail, sum, minBy, maxBy, compareKeys, range, roundTo, boolText };