eyelang 1.2.2 → 1.3.0

package/examples/delfour.pl

@@ -1,281 +0,0 @@
-% Delfour insight-economy case adapted from Eyeling delfour.n3.
-% The original N3 emits a Markdown answer.  This eyelang
-% translation derives the same authorization, shopping banner, alternative, and
-% checklist facts as relation materialization.
-%
-% Static input is kept as scoped data: the case, insight, policy, envelope, and
-% signature are context terms, while the product catalog is a list of records.
-% Rules project only the fields they need, avoiding global permission/prohibition
-% facts that could contradict another policy formula in the same program.
-
-% Output declarations: materialize/2 selects the relations written to this example's golden output.
-materialize(caseName, 2).
-materialize(needsLowSugar, 2).
-materialize(derivedFromNeed, 2).
-materialize(outcome, 2).
-materialize(target, 2).
-materialize(metric, 2).
-materialize(threshold, 2).
-materialize(scope, 2).
-materialize(retailer, 2).
-materialize(expiresAt, 2).
-materialize(scannedProduct, 2).
-materialize(suggestedAlternative, 2).
-materialize(headline, 2).
-materialize(note, 2).
-materialize(reason, 2).
-materialize(value, 2).
-materialize(alg, 2).
-materialize(auditEntries, 2).
-materialize(filesWritten, 2).
-materialize(allChecksPass, 2).
-materialize(signatureVerifies, 2).
-materialize(payloadHashMatches, 2).
-materialize(minimizationStripsSensitiveTerms, 2).
-materialize(scopeComplete, 2).
-materialize(authorizationAllowed, 2).
-materialize(bannerFlagsHighSugar, 2).
-materialize(alternativeIsLowerSugar, 2).
-materialize(dutyTimingConsistent, 2).
-materialize(marketingProhibited, 2).
-materialize(filesWrittenExpected, 2).
-
-% Program structure: facts set up the scenario, and rules derive the materialized conclusions.
-% Context-valued facts keep each input graph scoped and easy to project.
-case_graph(delfourCaseGraph, (
-  caseName(case, "delfour"),
-  requestPurpose(case, "shopping_assist"),
-  requestAction(case, odrl_use),
-  phoneCreatedAt(case, "2025-10-05T20:33:48.907163+00:00"),
-  phoneExpiresAt(case, "2025-10-05T22:33:48.907185+00:00"),
-  scannerAuthAt(case, "2025-10-05T20:35:48.907163+00:00"),
-  scannerDutyAt(case, "2025-10-05T20:37:48.907163+00:00"),
-  filesWritten(case, 6),
-  auditEntries(case, 1),
-  condition(householdProfile, "Diabetes"),
-  scannedProduct(scan, prod_BIS_001)
-)).
-
-% Catalog rows are product(IdTerm, DisplayId, Name, SugarTenths, SugarG).
-product_catalog(delfourCatalog, [
-  product(prod_BIS_001, "prod_BIS_001", "Classic Tea Biscuits", 120, 12.0),
-  product(prod_BIS_101, "prod_BIS_101", "Low-Sugar Tea Biscuits", 30, 3.0),
-  product(prod_CHOC_050, "prod_CHOC_050", "Milk Chocolate Bar", 150, 15.0),
-  product(prod_CHOC_150, "prod_CHOC_150", "85% Dark Chocolate", 60, 6.0)
-]).
-
-insight_graph(delfourInsightGraph, (
-  metric(insight, "sugar_g_per_serving"),
-  thresholdTenths(insight, 100),
-  thresholdDisplay(insight, "10.0"),
-  thresholdG(insight, 10.0),
-  suggestionPolicy(insight, "lower_metric_first_higher_price_ok"),
-  scopeDevice(insight, "self-scanner"),
-  scopeEvent(insight, "pick_up_scanner"),
-  retailer(insight, "Delfour"),
-  createdAt(insight, "2025-10-05T20:33:48.907163+00:00"),
-  expiresAt(insight, "2025-10-05T22:33:48.907185+00:00"),
-  serializedLowercase(insight, "createdat expiresat insight metric sugar_g_per_serving retailer delfour scopedevice self-scanner scopeevent pick_up_scanner")
-)).
-
-policy_graph(delfourPolicyGraph, (
-  odrl_permission(policy, permission(odrl_use, insight, "shopping_assist")),
-  odrl_prohibition(policy, prohibition(odrl_distribute, insight, "marketing")),
-  odrl_duty(policy, duty(odrl_delete, "2025-10-05T22:33:48.907185+00:00"))
-)).
-
-envelope_graph(delfourEnvelopeGraph, (
-  insight(envelope, delfourInsightGraph),
-  policy(envelope, delfourPolicyGraph),
-  hash(envelope, "34ad35638dfd7c67d031eeca8abb235ec24280740f863f3f31cd9d7b6517f098")
-)).
-
-signature_graph(delfourSignatureGraph, (
-  alg(signature, "HMAC-SHA256"),
-  keyid(signature, "demo-shared-secret"),
-  created(signature, "2025-10-05T20:33:48.907163+00:00"),
-  payloadHashSha256(signature, "34ad35638dfd7c67d031eeca8abb235ec24280740f863f3f31cd9d7b6517f098"),
-  hmac(signature, "b21d0072d90112a9f820aced0286889f4b6ef92b145e6fdef1011f3bfa4608c2"),
-  hmacVerificationMode(signature, trustedPrecomputedInput)
-)).
-
-reason_text(reasonText, "Household requires low-sugar guidance (diabetes in POD). A neutral Insight is scoped to device 'self-scanner', event 'pick_up_scanner', retailer 'Delfour', and expires soon; the policy confines use to shopping assistance.").
-
-% Derivation rules: each rule below contributes one logical step toward the displayed results.
-case_statement(S, P, O) :- case_graph(delfourCaseGraph, Context), holds(Context, P, [S, O]).
-insight_statement(S, P, O) :- insight_graph(delfourInsightGraph, Context), holds(Context, P, [S, O]).
-policy_statement(S, P, O) :- policy_graph(delfourPolicyGraph, Context), holds(Context, P, [S, O]).
-envelope_statement(S, P, O) :- envelope_graph(delfourEnvelopeGraph, Context), holds(Context, P, [S, O]).
-signature_statement(S, P, O) :- signature_graph(delfourSignatureGraph, Context), holds(Context, P, [S, O]).
-
-case_name(case, Name) :- case_statement(case, caseName, Name).
-request_purpose(case, Purpose) :- case_statement(case, requestPurpose, Purpose).
-request_action(case, Action) :- case_statement(case, requestAction, Action).
-phone_created_at(case, Time) :- case_statement(case, phoneCreatedAt, Time).
-phone_expires_at(case, Time) :- case_statement(case, phoneExpiresAt, Time).
-scanner_auth_at(case, Time) :- case_statement(case, scannerAuthAt, Time).
-scanner_duty_at(case, Time) :- case_statement(case, scannerDutyAt, Time).
-files_written(case, Count) :- case_statement(case, filesWritten, Count).
-audit_entries(case, Count) :- case_statement(case, auditEntries, Count).
-condition(householdProfile, Condition) :- case_statement(householdProfile, condition, Condition).
-scanned_product(scan, Product) :- case_statement(scan, scannedProduct, Product).
-
-product(Product) :- product_catalog(delfourCatalog, Products), member(product(Product, _Id, _Name, _SugarTenths, _SugarG), Products).
-product_id(Product, Id) :- product_catalog(delfourCatalog, Products), member(product(Product, Id, _Name, _SugarTenths, _SugarG), Products).
-product_name(Product, Name) :- product_catalog(delfourCatalog, Products), member(product(Product, _Id, Name, _SugarTenths, _SugarG), Products).
-sugar_tenths(Product, Sugar) :- product_catalog(delfourCatalog, Products), member(product(Product, _Id, _Name, Sugar, _SugarG), Products).
-sugar_per_serving(Product, Sugar) :- product_catalog(delfourCatalog, Products), member(product(Product, _Id, _Name, _SugarTenths, Sugar), Products).
-
-insight(insight).
-metric(insight, Metric) :- insight_statement(insight, metric, Metric).
-threshold_tenths(insight, Threshold) :- insight_statement(insight, thresholdTenths, Threshold).
-threshold_display(insight, Threshold) :- insight_statement(insight, thresholdDisplay, Threshold).
-threshold_g(insight, Threshold) :- insight_statement(insight, thresholdG, Threshold).
-suggestion_policy(insight, Policy) :- insight_statement(insight, suggestionPolicy, Policy).
-scope_device(insight, Device) :- insight_statement(insight, scopeDevice, Device).
-scope_event(insight, Event) :- insight_statement(insight, scopeEvent, Event).
-retailer(insight, Retailer) :- insight_statement(insight, retailer, Retailer).
-created_at(insight, Time) :- insight_statement(insight, createdAt, Time).
-expires_at(insight, Time) :- insight_statement(insight, expiresAt, Time).
-serialized_lowercase(insight, Text) :- insight_statement(insight, serializedLowercase, Text).
-
-policy(policy).
-permission(policy, Action, Target, Purpose) :- policy_statement(policy, odrl_permission, permission(Action, Target, Purpose)).
-prohibition(policy, Action, Target, Purpose) :- policy_statement(policy, odrl_prohibition, prohibition(Action, Target, Purpose)).
-duty(policy, Action, Time) :- policy_statement(policy, odrl_duty, duty(Action, Time)).
-
-envelope_insight(envelope, Insight) :- envelope_statement(envelope, insight, Insight).
-envelope_policy(envelope, Policy) :- envelope_statement(envelope, policy, Policy).
-envelope_hash(envelope, Hash) :- envelope_statement(envelope, hash, Hash).
-signature_alg(signature, Alg) :- signature_statement(signature, alg, Alg).
-signature_keyid(signature, KeyId) :- signature_statement(signature, keyid, KeyId).
-signature_created(signature, Time) :- signature_statement(signature, created, Time).
-payload_hash_sha256(signature, Hash) :- signature_statement(signature, payloadHashSha256, Hash).
-signature_hmac(signature, Hmac) :- signature_statement(signature, hmac, Hmac).
-hmac_verification_mode(signature, Mode) :- signature_statement(signature, hmacVerificationMode, Mode).
-
-% The household profile creates the low-sugar need used by the insight.
-needs_low_sugar(case) :-
-  condition(householdProfile, "Diabetes").
-
-derived_from_need(insight, "low_sugar") :-
-  needs_low_sugar(case).
-
-payload_hash_matches(check) :-
-  envelope_hash(envelope, Digest),
-  payload_hash_sha256(signature, Digest).
-
-signature_verifies(check) :-
-  hmac_verification_mode(signature, trustedPrecomputedInput).
-
-minimization_strips_sensitive_terms(check) :-
-  serialized_lowercase(insight, Text),
-  not_matches(Text, "diabetes|medical").
-
-scope_complete(check) :-
-  scope_device(insight, _Device),
-  scope_event(insight, _Event),
-  expires_at(insight, _Expiry).
-
-authorization_allowed(check) :-
-  permission(policy, odrl_use, insight, "shopping_assist"),
-  request_purpose(case, "shopping_assist"),
-  scanner_auth_at(case, AuthAt),
-  expires_at(insight, ExpiresAt),
-  le(AuthAt, ExpiresAt).
-
-decision(decision, "Allowed", insight) :-
-  authorization_allowed(check).
-
-banner_flags_high_sugar(check) :-
-  decision(decision, "Allowed", insight),
-  scanned_product(scan, Product),
-  sugar_per_serving(Product, Sugar),
-  threshold_g(insight, Threshold),
-  ge(Sugar, Threshold).
-
-banner_headline(banner, "Track sugar per serving while you scan") :-
-  banner_flags_high_sugar(check).
-
-banner_note(banner, "High sugar") :-
-  banner_flags_high_sugar(check).
-
-better_lower_sugar(ScannedSugar, CandidateSugar) :-
-  product(Other),
-  sugar_tenths(Other, OtherSugar),
-  gt(ScannedSugar, OtherSugar),
-  lt(OtherSugar, CandidateSugar).
-
-% Pick the lowest-sugar alternative according to the insight suggestion policy.
-suggested_alternative(case, Candidate) :-
-  scanned_product(scan, Scanned),
-  sugar_tenths(Scanned, ScannedSugar),
-  product(Candidate),
-  sugar_tenths(Candidate, CandidateSugar),
-  gt(ScannedSugar, CandidateSugar),
-  not(better_lower_sugar(ScannedSugar, CandidateSugar)).
-
-banner_suggested_alternative(banner, Name) :-
-  banner_note(banner, "High sugar"),
-  suggested_alternative(case, Alternative),
-  product_name(Alternative, Name).
-
-alternative_is_lower_sugar(check) :-
-  scanned_product(scan, Scanned),
-  sugar_tenths(Scanned, ScannedSugar),
-  suggested_alternative(case, Alternative),
-  sugar_tenths(Alternative, AlternativeSugar),
-  gt(ScannedSugar, AlternativeSugar).
-
-duty_timing_consistent(check) :-
-  scanner_duty_at(case, DutyAt),
-  expires_at(insight, ExpiresAt),
-  le(DutyAt, ExpiresAt).
-
-marketing_prohibited(check) :-
-  prohibition(policy, odrl_distribute, insight, "marketing").
-
-files_written_expected(check) :-
-  files_written(case, 6).
-
-all_checks_pass(result) :-
-  signature_verifies(check),
-  payload_hash_matches(check),
-  minimization_strips_sensitive_terms(check),
-  scope_complete(check),
-  authorization_allowed(check),
-  banner_flags_high_sugar(check),
-  alternative_is_lower_sugar(check),
-  duty_timing_consistent(check),
-  marketing_prohibited(check),
-  files_written_expected(check).
-
-caseName(case, Name) :- case_name(case, Name).
-needsLowSugar(case, true) :- needs_low_sugar(case).
-derivedFromNeed(insight, Need) :- derived_from_need(insight, Need).
-outcome(decision, Outcome) :- decision(decision, Outcome, _Target).
-target(decision, Target) :- decision(decision, _Outcome, Target).
-scannedProduct(scan, ProductName) :- scanned_product(scan, Product), product_name(Product, ProductName).
-suggestedAlternative(case, Name) :- suggested_alternative(case, Alternative), product_name(Alternative, Name).
-threshold(insight, Threshold) :- threshold_display(insight, Threshold).
-scope(insight, "self-scanner @ pick_up_scanner") :- scope_device(insight, "self-scanner"), scope_event(insight, "pick_up_scanner").
-expiresAt(insight, Time) :- expires_at(insight, Time).
-reason(why, "The phone desensitizes a diabetes-related household condition into a scoped low-sugar need, wraps it in an expiring Insight + Policy envelope, signs it, and the scanner consumes that envelope for shopping assistance.") :- authorization_allowed(check).
-headline(banner, Headline) :- banner_headline(banner, Headline).
-note(banner, Note) :- banner_note(banner, Note).
-suggestedAlternative(banner, Name) :- banner_suggested_alternative(banner, Name).
-value(reasonText, Text) :- reason_text(reasonText, Text).
-alg(signature, Alg) :- signature_alg(signature, Alg).
-auditEntries(case, Count) :- audit_entries(case, Count).
-filesWritten(case, Count) :- files_written(case, Count).
-allChecksPass(result, true) :- all_checks_pass(result).
-signatureVerifies(check, true) :- signature_verifies(check).
-payloadHashMatches(check, true) :- payload_hash_matches(check).
-minimizationStripsSensitiveTerms(check, true) :- minimization_strips_sensitive_terms(check).
-scopeComplete(check, true) :- scope_complete(check).
-authorizationAllowed(check, true) :- authorization_allowed(check).
-bannerFlagsHighSugar(check, true) :- banner_flags_high_sugar(check).
-alternativeIsLowerSugar(check, true) :- alternative_is_lower_sugar(check).
-dutyTimingConsistent(check, true) :- duty_timing_consistent(check).
-marketingProhibited(check, true) :- marketing_prohibited(check).
-filesWrittenExpected(check, true) :- files_written_expected(check).

package/examples/deontic-logic.pl

@@ -1,52 +0,0 @@
-% Deontic logic: obligations, prohibitions, compensations, and violations.
-% The example separates normative facts from observed actions.  Missing an
-% obligation and performing a prohibited action are violations, but a prohibited
-% action can be marked compensated when the configured repair action occurred.
-
-materialize(violation, 2).
-materialize(compensation, 2).
-materialize(status, 2).
-
-% Facts state what the actor was obliged/prohibited to do and what happened.
-actor(alice).
-action(share_record).
-action(delete_unneeded_copy).
-
-obliged(alice, obtain_consent).
-prohibited(alice, share_record).
-compensates(share_record, notify_dpo).
-
-performed(alice, share_record).
-performed(alice, notify_dpo).
-not_performed(alice, obtain_consent).
-not_performed(alice, delete_unneeded_copy).
-
-% Missing an obligation and performing a prohibited action are both violations.
-violation(Actor, missed_obligation(Action)) :-
-  obliged(Actor, Action),
-  not_performed(Actor, Action).
-
-violation(Actor, prohibited_action(Action)) :-
-  prohibited(Actor, Action),
-  performed(Actor, Action).
-
-% Some prohibited actions can be repaired by a configured compensation action.
-compensated_violation(Actor, Action, Compensation) :-
-  prohibited(Actor, Action),
-  performed(Actor, Action),
-  compensates(Action, Compensation),
-  performed(Actor, Compensation).
-
-uncompensated_violation(Actor, missed_obligation(Action)) :-
-  violation(Actor, missed_obligation(Action)).
-
-uncompensated_violation(Actor, prohibited_action(Action)) :-
-  violation(Actor, prohibited_action(Action)),
-  not(compensated_violation(Actor, Action, _Compensation)).
-
-
-compensation(Actor, compensation(Action, Compensation)) :-
-  compensated_violation(Actor, Action, Compensation).
-
-status(Actor, requires_review) :-
-  uncompensated_violation(Actor, _Violation).

package/examples/derived-backward-rule.pl

@@ -1,30 +0,0 @@
-% Derived backward rule example adapted from Eyeling derived-backward-rule.n3.
-%
-% Eyeling source shape:
-%   parentOf invOf childOf.
-%   alice parentOf bob.
-%   { ?p invOf ?q. } => { { ?x ?q ?y. } <= { ?y ?p ?x. }. }.
-%   { ?x childOf ?y. } => { ?x hasParent ?y. }.
-%
-% The generated backward rule is represented as quoted formula data in
-% log_impliedBy/2, then mirrored as an ordinary eyelang rule so the generated
-% childOf relation can feed the ordinary hasParent rule.
-
-% Output declarations: materialize/2 selects the relations written to this example's golden output.
-materialize(log_impliedBy, 2).
-materialize(childOf, 2).
-materialize(hasParent, 2).
-
-% Program structure: facts set up the scenario, and rules derive the materialized conclusions.
-invOf(parentOf, childOf).
-parentOf(alice, bob).
-
-% Derivation rules: each rule below contributes one logical step toward the displayed results.
-log_impliedBy(childOf(var(x), var(y)), parentOf(var(y), var(x))) :-
-  invOf(parentOf, childOf).
-
-childOf(X, Y) :-
-  log_impliedBy(childOf(var(x), var(y)), parentOf(var(y), var(x))),
-  parentOf(Y, X).
-
-hasParent(X, Y) :- childOf(X, Y).

package/examples/derived-rule.pl

@@ -1,27 +0,0 @@
-% Derived rule example adapted from Eyeling derived-rule.n3.
-%
-% Eyeling source shape:
-%   minka a cat.
-%   charly a dog.
-%   { ?x a cat. } => { { ?y a dog. } => { test is true. }. }.
-%
-% The inner implication is represented directly as quoted formula data.
-% var(y) is not an eyelang variable; it is a ground term that names
-% a variable placeholder inside the quoted formula.
-
-% Output declarations: materialize/2 selects the relations written to this example's golden output.
-materialize(type, 2).
-materialize(log_implies, 2).
-materialize(is, 2).
-
-% Program structure: facts set up the scenario, and rules derive the materialized conclusions.
-type(minka, cat).
-type(charly, dog).
-
-% Derivation rules: each rule below contributes one logical step toward the displayed results.
-log_implies(type(var(y), dog), is(test, true)) :-
-  type(_X, cat).
-
-is(test, true) :-
-  log_implies(type(var(y), dog), is(test, true)),
-  type(_Y, dog).

package/examples/diamond-property.pl

@@ -1,38 +0,0 @@
-% Diamond property, adapted from Eyelet's input/diamond-property.pl.
-%
-% A relation has the diamond property when two outgoing steps from the same
-% source can be joined again.  This compact eyelang version keeps the same
-% diamond idea and also checks that it is preserved by reflexive closure.
-
-% Output declarations: materialize/2 selects the relations written to this example's golden output.
-materialize(holdsFor, 2).
-materialize(commonSuccessor, 2).
-materialize(preservedUnderReflexiveClosure, 2).
-
-% Program structure: facts set up the scenario, and rules derive the materialized conclusions.
-node(a).
-node(b).
-node(c).
-node(d).
-
-r(a, b).
-r(a, c).
-r(b, d).
-r(c, d).
-
-% Derivation rules: each rule below contributes one logical step toward the displayed results.
-re(X, X) :- node(X).
-re(X, Y) :- r(X, Y).
-
-diamond(Rel, A, B, C, D) :-
-  step(Rel, A, B),
-  step(Rel, A, C),
-  step(Rel, B, D),
-  step(Rel, C, D).
-
-step(r, X, Y) :- r(X, Y).
-step(re, X, Y) :- re(X, Y).
-
-holdsFor(diamondProperty, Rel) :- diamond(Rel, a, b, c, d).
-commonSuccessor(diamondProperty, D) :- diamond(r, a, b, c, D).
-preservedUnderReflexiveClosure(diamondProperty, true) :- diamond(re, a, b, c, d).

package/examples/dijkstra-findall-sort.pl

@@ -1,43 +0,0 @@
-% Eyelet-inspired Dijkstra example using findall/3 and sort/2.
-% The priority queue is represented as sorted list entries [Cost, Node | Path].
-% Each expansion collects unvisited neighbors with findall/3, appends them to
-% the frontier, and uses sort/2 so the cheapest frontier entry is processed next.
-
-materialize(shortestPath, 2).
-materialize(cost, 2).
-materialize(reason, 2).
-
-% Weighted undirected graph; the symmetric edge rule below adds reverse arcs.
-edge(a, b, 4).
-edge(a, c, 2).
-edge(b, c, 1).
-edge(b, d, 5).
-edge(c, d, 8).
-edge(c, e, 10).
-edge(d, e, 2).
-edge(d, f, 6).
-edge(e, f, 3).
-edge(A, B, Cost) :- edge(B, A, Cost).
-
-% The frontier is represented as [Cost, Node | ReversePath] entries.
-dijkstra(Start, Goal, Path, Cost) :-
-  dijkstra_queue([[0, Start]], Goal, [], RevPath, Cost),
-  reverse(RevPath, Path).
-
-dijkstra_queue([[Cost, Goal | Path] | _Queue], Goal, _Visited, [Goal | Path], Cost).
-dijkstra_queue([[Cost, Node | Path] | Queue], Goal, Visited, ResultPath, ResultCost) :-
-  % Expand all unvisited neighbors, then sort so the cheapest frontier wins.
-  findall([NewCost, Neighbor, Node | Path],
-    (edge(Node, Neighbor, Weight), not(member(Neighbor, Visited)), add(Cost, Weight, NewCost)),
-    Neighbors),
-  append(Queue, Neighbors, NewQueue),
-  sort(NewQueue, SortedQueue),
-  dijkstra_queue(SortedQueue, Goal, [Node | Visited], ResultPath, ResultCost).
-
-shortestPath(dijkstra_findall_sort, Path) :-
-  once(dijkstra(a, f, Path, _Cost)).
-
-cost(dijkstra_findall_sort, Cost) :-
-  once(dijkstra(a, f, _Path, Cost)).
-
-reason(dijkstra_findall_sort, "frontier candidates are collected with findall and ordered with sort").

package/examples/dijkstra-risk-path.pl

@@ -1,87 +0,0 @@
-% Risk-adjusted route selection adapted from Eyeling dijkstra-risk-path.n3.
-%
-% The score is raw delivery cost plus ten times accumulated risk.  Candidate
-% routes are fixed path lists, while route_cost/4 reduces each list to raw cost,
-% risk, and edge count.  Memoization lets selected-path, scoring, and trust-gate
-% relations reuse those reductions.
-materialize(route, 2).
-materialize(rawCost, 2).
-materialize(riskSum, 2).
-materialize(score, 2).
-materialize(edgeCount, 2).
-materialize(selectedPath, 2).
-materialize(trustGate, 2).
-materialize(notes, 2).
-materialize(selects, 2).
-
-% Cache route-list reductions because several materialized reports ask for the same metrics.
-memoize(route_cost, 4).
-
-% Segments live in a quoted formula term, while candidate paths remain ordinary lists.
-route_network(riskNetwork, (
-  segment(depotA, segment(depotB, 4.0, 0.2)),
-  segment(depotB, segment(labD, 4.0, 0.3)),
-  segment(depotA, segment(depotC, 3.0, 0.9)),
-  segment(depotC, segment(labD, 6.0, 0.3)),
-  segment(depotC, segment(depotB, 0.5, 0.5)),
-  segment(depotB, segment(depotC, 1.0, 0.5)),
-  segment(depotA, segment(relay, 5.0, 0.2)),
-  segment(relay, segment(labD, 5.0, 0.2)),
-  segment(depotA, segment(labD, 14.0, 0.05))
-)).
-
-% Derivation rules: each rule below contributes one logical step toward the displayed results.
-route_segment(From, To, Raw, Risk) :-
-  route_network(riskNetwork, Context),
-  holds(Context, segment(From, segment(To, Raw, Risk))).
-
-candidate(pathB, [depotA, depotB, labD]).
-candidate(pathC, [depotA, depotC, labD]).
-candidate(pathRelay, [depotA, relay, labD]).
-candidate(pathDirectC, [depotA, labD]).
-candidate(pathViaC, [depotA, depotC, depotB, labD]).
-
-route_cost([_], 0.0, 0.0, 0).
-route_cost([From, To|Rest], Raw, Risk, Edges) :-
-  route_segment(From, To, StepRaw, StepRisk),
-  route_cost([To|Rest], RestRaw, RestRisk, RestEdges),
-  add(StepRaw, RestRaw, Raw),
-  add(StepRisk, RestRisk, Risk),
-  add(1, RestEdges, Edges).
-
-score(Raw, Risk, Score) :-
-  mul(Risk, 10.0, Penalty),
-  add(Raw, Penalty, Score).
-
-path_metrics(Path, Route, Raw, Risk, Score, Edges) :-
-  candidate(Path, Route),
-  route_cost(Route, Raw, Risk, Edges),
-  score(Raw, Risk, Score).
-
-% Pick the known winner by comparing its score with every other candidate.
-best_path(pathB) :-
-  path_metrics(pathB, _BestRoute, _BestRaw, _BestRisk, BestScore, _BestEdges),
-  path_metrics(pathC, _CRoute, _CRaw, _CRisk, CScore, _CEdges),
-  path_metrics(pathRelay, _RRoute, _RRaw, _RRisk, RelayScore, _REdges),
-  path_metrics(pathDirectC, _DRoute, _DRaw, _DRisk, DirectScore, _DEdges),
-  path_metrics(pathViaC, _VRoute, _VRaw, _VRisk, ViaScore, _VEdges),
-  lt(BestScore, CScore),
-  lt(BestScore, RelayScore),
-  lt(BestScore, DirectScore),
-  lt(BestScore, ViaScore).
-
-risk_outweighs_raw_cost(true) :-
-  path_metrics(pathB, _BR, BestRaw, _BRS, BestScore, _BE),
-  path_metrics(pathViaC, _VR, ViaRaw, _VRS, ViaScore, _VE),
-  lt(ViaRaw, BestRaw),
-  lt(BestScore, ViaScore).
-
-route(Path, Route) :- path_metrics(Path, Route, _Raw, _Risk, _Score, _Edges).
-rawCost(Path, Raw) :- path_metrics(Path, _Route, Raw, _Risk, _Score, _Edges).
-riskSum(Path, Risk) :- path_metrics(Path, _Route, _Raw, Risk, _Score, _Edges).
-score(Path, Score) :- path_metrics(Path, _Route, _Raw, _Risk, Score, _Edges).
-edgeCount(Path, Edges) :- path_metrics(Path, _Route, _Raw, _Risk, _Score, Edges).
-selectedPath(case, Path) :- best_path(Path).
-trustGate(case, noEnumeratedPathIsLower) :- best_path(_Path).
-notes(case, riskCanOutweighRawCost) :- risk_outweighs_raw_cost(true).
-selects(dijkstraRiskPath, Path) :- best_path(Path), risk_outweighs_raw_cost(true).

package/examples/dijkstra.pl

@@ -1,50 +0,0 @@
-% Weighted path enumeration adapted from Eyeling dijkstra.n3.
-%
-% The Eyeling source uses collect/sort built-ins for Dijkstra's queue.  This
-% eyelang variant enumerates simple paths, keeps the bounded frontier shown in
-% the Eyeling output for a -> f, and scopes the graph inside a quoted term so the
-% route network is not asserted as ambient edge facts.
-
-% Output declarations: materialize/2 selects the relations written to this example's golden output.
-materialize(edge, 2).
-materialize(path, 2).
-
-% The weighted graph stays inside weighted_graph/2; base_link/3 projects only
-% the scoped edges needed by this example before the undirected link/3 view is built.
-weighted_graph(dijkstraGraph, (
-  edge(a, arc(b, 4)),
-  edge(a, arc(c, 2)),
-  edge(b, arc(c, 1)),
-  edge(b, arc(d, 5)),
-  edge(c, arc(d, 8)),
-  edge(c, arc(e, 10)),
-  edge(d, arc(e, 2)),
-  edge(d, arc(f, 6)),
-  edge(e, arc(f, 3))
-)).
-
-% path/5 carries both the visited list and accumulated cost, so the search
-% enumerates simple weighted routes without asserting intermediate route facts.
-base_link(A, B, Cost) :-
-  weighted_graph(dijkstraGraph, Context),
-  holds(Context, edge(A, arc(B, Cost))).
-
-% Build an undirected view from directed base edges.
-link(A, B, Cost) :- base_link(A, B, Cost).
-link(B, A, Cost) :- base_link(A, B, Cost).
-
-path(Goal, Goal, _Visited, [Goal], 0).
-path(Node, Goal, Visited, [Node|Path], Cost) :-
-  link(Node, Next, StepCost),
-  not_member(Next, Visited),
-  path(Next, Goal, [Next|Visited], Path, RestCost),
-  add(StepCost, RestCost, Cost).
-
-% Derived reverse links, mirroring the rule output in the Eyeling example.
-edge([B, A], Cost) :-
-  base_link(A, B, Cost).
-
-% Only paths within the displayed cost bound are materialized.
-path([a, f], [Path, Cost]) :-
-  path(a, f, [a], Path, Cost),
-  le(Cost, 16).