eyelang 1.2.2 → 1.3.1

package/examples/delfour.eye

@@ -0,0 +1,281 @@
+% 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.eye

@@ -0,0 +1,52 @@
+% 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.eye

@@ -0,0 +1,30 @@
+% 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.eye

@@ -0,0 +1,27 @@
+% 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.eye

@@ -0,0 +1,38 @@
+% Diamond property, adapted from Eyelet's input/diamond-property.eye.
+%
+% 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.eye

@@ -0,0 +1,43 @@
+% 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.eye

@@ -0,0 +1,87 @@
+% 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.
+table(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.eye

@@ -0,0 +1,50 @@
+% 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).