eyeprolog 1.6.35 → 1.6.37

package/examples/auroracare.pl

@@ -231,6 +231,7 @@ research_policy_match(S) :-
   environment(S, "secure_env"),
   tom(S, anonymisation),
   subject_opt_in(S),
+  \+ subject_opt_out(S),
   category(S, labResults).
 
 insurance_prohibition_match(S) :-
@@ -241,18 +242,30 @@ ai_training_opt_out_match(S) :-
   purpose(S, trainTestAndEvaluateAiSystemsAlgorithms),
   subject_opt_out(S).
 
+% A scenario is permitted when some permission policy matches, and prohibited
+% when a prohibition or the subject's opt-out applies.
+permission_match(S) :- primary_policy_match(S).
+permission_match(S) :- qi_policy_match(S).
+permission_match(S) :- research_policy_match(S).
+
+prohibition_match(S) :- insurance_prohibition_match(S).
+prohibition_match(S) :- subject_opt_out(S).
+
+% Deny by default: neither a permission nor a prohibition applies.
+no_policy_match(S) :-
+  scenario(S),
+  \+ permission_match(S),
+  \+ prohibition_match(S).
+
 careTeamLinked(S, true) :- care_team_linked(S).
 subjectOptIn(S, true) :- subject_opt_in(S).
 subjectOptOut(S, true) :- subject_opt_out(S).
 
-% Permit when a scenario satisfies one of the allowed policy branches.
-decision(S, "PERMIT") :- primary_policy_match(S).
-decision(S, "PERMIT") :- qi_policy_match(S).
-decision(S, "PERMIT") :- research_policy_match(S).
-% Deny branches preserve the reason that will be queried for the report.
-decision(S, "DENY") :- insurance_prohibition_match(S).
-decision(S, "DENY") :- ai_training_opt_out_match(S).
-decision(scenarioC, "DENY") :- purpose(scenarioC, ensureQualitySafetyHealthcare).
+% Permit when a permission matches and no prohibition applies; a prohibition
+% always denies, and a scenario that matches nothing is denied by default.
+decision(S, "PERMIT") :- permission_match(S), \+ prohibition_match(S).
+decision(S, "DENY") :- prohibition_match(S).
+decision(S, "DENY") :- no_policy_match(S).
 
 matchedPolicyUid(S, Uid) :- primary_policy_match(S), policyUid(policyPrimary, Uid).
 matchedPolicyUid(S, Uid) :- qi_policy_match(S), policyUid(policyQi, Uid).
@@ -264,7 +277,8 @@ reason(S, "Permitted: ODRL/DPV policy matched for secondary use.") :- qi_policy_
 reason(S, "Permitted: subject opted in and an ODRL/DPV policy matched (anonymised dataset in secure environment).") :- research_policy_match(S).
 reason(S, "Denied: the requested purpose (insurance management) is prohibited by policy.") :- insurance_prohibition_match(S).
 reason(S, "Denied: you opted out of your data being used to train AI systems.") :- ai_training_opt_out_match(S).
-reason(scenarioC, "Denied: no policy matched (purpose, environment, TOMs, or categories out of scope).") :- purpose(scenarioC, ensureQualitySafetyHealthcare).
+reason(S, "Denied: the subject opted out of this purpose.") :- subject_opt_out(S), \+ ai_training_opt_out_match(S).
+reason(S, "Denied: no policy matched (purpose, environment, TOMs, or categories out of scope).") :- no_policy_match(S).
 
 trace(S, "permit:primary_care_allowed") :- primary_policy_match(S).
 trace(S, "urn:policy:primary-care-001:permit:odrl:permission_matched") :- primary_policy_match(S).
@@ -273,7 +287,8 @@ trace(S, "urn:policy:research-aurora-diabetes:permit:odrl:permission_matched") :
 trace(S, "deny:prohibited_purpose") :- insurance_prohibition_match(S).
 trace(S, "urn:policy:deny-insurance:deny:odrl:prohibition_matched") :- insurance_prohibition_match(S).
 trace(S, "deny:subject_opted_out_ai_training") :- ai_training_opt_out_match(S).
-trace(scenarioC, "urn:policy:qi-2025-aurora:deny:odrl:no_permission_matched") :- purpose(scenarioC, ensureQualitySafetyHealthcare).
+trace(S, "deny:subject_opted_out") :- subject_opt_out(S), \+ ai_training_opt_out_match(S).
+trace(S, "deny:no_permission_matched") :- no_policy_match(S).
 
 % C1-C10 below are the ARC-style checklist lines from the upstream output.
 checkC1(scenarioA, "SKIPPED - not a prohibited purpose") :- decision(scenarioA, "PERMIT").

package/examples/chart-parser.pl

@@ -12,7 +12,9 @@
 
 
 
-% Two sample sentences share the same tiny grammar but have different parse counts.
+% Two sample sentences share the same tiny grammar. The second is ambiguous: the
+% prepositional phrase "with the telescope" can attach to "the box" or to "sees
+% the box", so it has two parse trees where the first has one.
 
 sentence(command, 5).
 sentence(ambiguous_pp, 8).
@@ -58,12 +60,32 @@ span(Sentence, Category, Start, End) :-
   span(Sentence, Left, Start, Middle),
   span(Sentence, Right, Middle, End).
 
+% The chart says which items exist; it stores each item once, however many ways
+% it can be built. Counting parse trees therefore needs its own relation: an
+% item's tree count is the sum, over every way to build it, of the product of
+% its parts' counts. Each recursive call covers a strictly shorter interval, so
+% the counting terminates without tabling.
+parse_trees(Sentence, Category, Start, End, Count) :-
+  sumall(N, tree_count(Sentence, Category, Start, End, N), Count).
+
+tree_count(Sentence, Category, Start, End, 1) :-
+  word(Sentence, Start, Token),
+  terminal(Category, Token),
+  (End =:= Start + 1).
+tree_count(Sentence, Category, Start, End, N) :-
+  rule(Category, Left, Right),
+  span(Sentence, Left, Start, Middle),
+  span(Sentence, Right, Middle, End),
+  parse_trees(Sentence, Left, Start, Middle, LeftCount),
+  parse_trees(Sentence, Right, Middle, End, RightCount),
+  (N is LeftCount * RightCount).
+
 chart_parser_answer(parsed, Sentence) :-
   sentence(Sentence, Length),
   span(Sentence, s, 0, Length).
 chart_parser_answer(parse_count, count(Sentence, Count)) :-
   sentence(Sentence, Length),
-  countall(span(Sentence, s, 0, Length), Count).
+  parse_trees(Sentence, s, 0, Length, Count).
 chart_parser_answer(noun_phrase_count, count(Sentence, Count)) :-
   sentence(Sentence, Length),
   countall(span(Sentence, np, _start, _end), Count),

package/examples/check/auroracare.pl

@@ -1,14 +1,21 @@
-condition('C1', resolution, ok, 174).
-condition('C2', well_founded, ok, 174).
-condition('C3', justification, ok, 174).
-condition('C4', coverage, ok, 273).
+condition('C1', resolution, ok, 181).
+condition('C2', well_founded, ok, 188).
+condition('C3', justification, ok, 188).
+condition('C4', coverage, ok, 287).
 condition('C5', re_decision, ok, 0).
-condition('C6', boundary_consistency, ok, 0).
-condition('C7', relevance, ok, 291).
-steps(174).
-verified(174).
+condition('C6', boundary_consistency, ok, 6).
+condition('C7', relevance, ok, 305).
+obligation(absent, theory_scoped, \+ prohibition_match(scenarioA)).
+obligation(absent, theory_scoped, \+ prohibition_match(scenarioE)).
+obligation(absent, theory_scoped, \+ prohibition_match(scenarioB)).
+obligation(absent, theory_scoped, \+ subject_opt_out(scenarioF)).
+obligation(absent, theory_scoped, \+ prohibition_match(scenarioF)).
+obligation(absent, theory_scoped, \+ permission_match(scenarioC)).
+obligation(absent, theory_scoped, \+ prohibition_match(scenarioC)).
+steps(188).
+verified(181).
 recomputed(0).
 composed(0).
-trusted(0).
+trusted(7).
 claims(117).
-verdict(checked).
+verdict(checked_with_obligations).

package/examples/check/chart-parser.pl

@@ -1,16 +1,16 @@
-condition('C1', resolution, ok, 57).
-condition('C2', well_founded, ok, 71).
-condition('C3', justification, ok, 71).
-condition('C4', coverage, ok, 92).
+condition('C1', resolution, ok, 59).
+condition('C2', well_founded, ok, 73).
+condition('C3', justification, ok, 73).
+condition('C4', coverage, ok, 94).
 condition('C5', re_decision, ok, 10).
 condition('C6', boundary_consistency, ok, 0).
-condition('C7', relevance, ok, 77).
-obligation(builtin, theory_scoped, countall(span(command, s, 0, 5), 1)).
-obligation(builtin, theory_scoped, countall(span(ambiguous_pp, s, 0, 8), 1)).
+condition('C7', relevance, ok, 79).
+obligation(builtin, theory_scoped, sumall(A, tree_count(command, s, 0, 5, A), 1)).
+obligation(builtin, theory_scoped, sumall(A, tree_count(ambiguous_pp, s, 0, 8, A), 2)).
 obligation(builtin, theory_scoped, countall(span(command, np, A, B), 2)).
 obligation(builtin, theory_scoped, countall(span(ambiguous_pp, np, A, B), 4)).
-steps(71).
-verified(57).
+steps(73).
+verified(59).
 recomputed(10).
 composed(0).
 trusted(4).

package/examples/check/composition-of-injective-functions-is-injective.pl

@@ -1,14 +1,17 @@
-condition('C1', resolution, ok, 16).
-condition('C2', well_founded, ok, 19).
-condition('C3', justification, ok, 19).
+condition('C1', resolution, ok, 19).
+condition('C2', well_founded, ok, 26).
+condition('C3', justification, ok, 26).
 condition('C4', coverage, ok, 33).
-condition('C5', re_decision, ok, 3).
+condition('C5', re_decision, ok, 4).
 condition('C6', boundary_consistency, ok, 0).
-condition('C7', relevance, ok, 21).
-steps(19).
-verified(16).
-recomputed(3).
+condition('C7', relevance, ok, 31).
+obligation(absent, theory_scoped, \+ collision(g, A, B)).
+obligation(absent, theory_scoped, \+ collision(f, A, B)).
+obligation(absent, theory_scoped, \+ collision(h, A, B)).
+steps(26).
+verified(19).
+recomputed(4).
 composed(0).
-trusted(0).
-claims(2).
-verdict(checked).
+trusted(3).
+claims(5).
+verdict(checked_with_obligations).

package/examples/check/delfour.pl

@@ -1,14 +1,14 @@
-condition('C1', resolution, ok, 243).
-condition('C2', well_founded, ok, 295).
-condition('C3', justification, ok, 295).
-condition('C4', coverage, ok, 354).
+condition('C1', resolution, ok, 244).
+condition('C2', well_founded, ok, 296).
+condition('C3', justification, ok, 296).
+condition('C4', coverage, ok, 353).
 condition('C5', re_decision, ok, 50).
 condition('C6', boundary_consistency, ok, 2).
-condition('C7', relevance, ok, 326).
-obligation(absent, theory_scoped, \+ better_lower_sugar(120, 30)).
+condition('C7', relevance, ok, 327).
+obligation(absent, theory_scoped, \+ better_lower_sugar(biscuits, 120, 30)).
 obligation(absent, theory_scoped, \+ matches('createdat expiresat insight metric sugar_g_per_serving retailer delfour scopedevice self-scanner scopeevent pick_up_scanner', 'diabetes|medical')).
-steps(295).
-verified(243).
+steps(296).
+verified(244).
 recomputed(50).
 composed(0).
 trusted(2).

package/examples/check/flandor.pl

@@ -1,15 +1,15 @@
 condition('C1', resolution, ok, 97).
-condition('C2', well_founded, ok, 105).
-condition('C3', justification, ok, 105).
-condition('C4', coverage, ok, 153).
-condition('C5', re_decision, ok, 6).
+condition('C2', well_founded, ok, 107).
+condition('C3', justification, ok, 107).
+condition('C4', coverage, ok, 157).
+condition('C5', re_decision, ok, 8).
 condition('C6', boundary_consistency, ok, 2).
-condition('C7', relevance, ok, 148).
+condition('C7', relevance, ok, 150).
 obligation(absent, theory_scoped, \+ lower_cost_eligible_package(120)).
 obligation(absent, theory_scoped, \+ matches('createdat expiresat insight metric regional_retooling_priority region flanders scopedevice economic-resilience-board scopeevent budget-prep-window suggestionpolicy lowest_cost_package_covering_all_active_needs threshold 3', 'salary|payroll|invoice|medical|firmname')).
-steps(105).
+steps(107).
 verified(97).
-recomputed(6).
+recomputed(8).
 composed(0).
 trusted(2).
 claims(43).

package/examples/check/gd-step-certified.pl

@@ -1,14 +1,14 @@
-condition('C1', resolution, ok, 191).
-condition('C2', well_founded, ok, 369).
-condition('C3', justification, ok, 369).
-condition('C4', coverage, ok, 678).
-condition('C5', re_decision, ok, 178).
+condition('C1', resolution, ok, 211).
+condition('C2', well_founded, ok, 398).
+condition('C3', justification, ok, 398).
+condition('C4', coverage, ok, 718).
+condition('C5', re_decision, ok, 187).
 condition('C6', boundary_consistency, ok, 0).
-condition('C7', relevance, ok, 448).
-steps(369).
-verified(191).
-recomputed(178).
+condition('C7', relevance, ok, 487).
+steps(398).
+verified(211).
+recomputed(187).
 composed(0).
 trusted(0).
-claims(79).
+claims(89).
 verdict(checked).

package/examples/check/lldm.pl

@@ -1,7 +1,7 @@
 condition('C1', resolution, ok, 53).
 condition('C2', well_founded, ok, 92).
 condition('C3', justification, ok, 92).
-condition('C4', coverage, ok, 160).
+condition('C4', coverage, ok, 164).
 condition('C5', re_decision, ok, 39).
 condition('C6', boundary_consistency, ok, 0).
 condition('C7', relevance, ok, 98).

package/examples/check/quine-mccluskey.pl

@@ -1,10 +1,10 @@
 condition('C1', resolution, ok, 145).
-condition('C2', well_founded, ok, 242).
-condition('C3', justification, ok, 242).
-condition('C4', coverage, ok, 307).
+condition('C2', well_founded, ok, 243).
+condition('C3', justification, ok, 243).
+condition('C4', coverage, ok, 308).
 condition('C5', re_decision, ok, 76).
 condition('C6', boundary_consistency, ok, 1).
-condition('C7', relevance, ok, 249).
+condition('C7', relevance, ok, 250).
 obligation(asserted, theory_scoped, solution_cache(["00xx", "0xx1", "xx11"], ["00xx", "xx11"])).
 obligation(collected, theory_scoped, findall(A, (member(B, ["00xx", "xx11"]), term_sop(B, A)), ['~A~B', 'CD'])).
 obligation(collected, theory_scoped, findall(A, minterm(A), [1, 3, 7, 11, 15])).
@@ -25,11 +25,12 @@ obligation(absent, theory_scoped, \+ covers_int("00xx", 13)).
 obligation(absent, theory_scoped, \+ covers_int("xx11", 13)).
 obligation(absent, theory_scoped, \+ covers_int("00xx", 14)).
 obligation(absent, theory_scoped, \+ covers_int("xx11", 14)).
+obligation(absent, theory_scoped, \+ smaller_cover(["00xx", "0xx1", "xx11"], [1, 3, 7, 11, 15], 1, A)).
 obligation(collected, theory_scoped, findall(A, (find_combination(2, ["00xx", "0xx1", "xx11"], A), covers_all(A, [1, 3, 7, 11, 15])), [["00xx", "xx11"], ["00xx", "xx11"], ["0xx1", "xx11"], ["0xx1", "xx11"], ["0xx1", "xx11"], ["0xx1", "xx11"]])).
-steps(242).
+steps(243).
 verified(145).
 recomputed(76).
 composed(0).
-trusted(21).
+trusted(22).
 claims(7).
 verdict(checked_with_obligations).

package/examples/composition-of-injective-functions-is-injective.pl

@@ -1,53 +1,61 @@
 % Composition of injective functions is injective.
 %
+% A function is injective when no two distinct inputs share an output. The
+% finite model below checks that property for f, g, and their composite
+% h = g o f, and derives that the composite inherits it. A second composite
+% h2 = g2 o f, built from a g2 that is not injective, shows that the premise
+% matters: h2 has a collision, so no injectivity is derived for it.
+%
 % The output is:
-% sameInputByCompositeInjectivity(h, a, b) and the symmetric counterpart.
+% compositeInjective(h, g, f), and the collisions of g2 and h2.
 
 % Output declarations: host-supplied goals select the relations written to this example's golden output.
-%% ?- sameInputByCompositeInjectivity(X0, X1, X2).
+%% ?- compositeInjective(X0, X1, X2).
+
+%% ?- collision(X0, X1, X2).
 
 
 :- discontiguous(app/3).
-:- discontiguous(sameTerm/2).
 
 % Program structure: facts set up the scenario, and rules derive the queried conclusions.
-inX(a).
-inX(b).
-inY(c).
-inY(d).
-inZ(e).
-
-% Derivation rules: each rule below contributes one logical step toward the displayed results.
-sameTerm(X, X) :- inX(X).
-sameTerm(X, X) :- inY(X).
-sameTerm(X, X) :- inZ(X).
-sameTerm(Y, X) :- Y @< X, sameTerm(X, Y).
+function(f).
+function(g).
+function(g2).
+function(h).
+function(h2).
 
+% f maps a and b to distinct points; g and g2 map c and d onward.
 app(f, a, c).
 app(f, b, d).
 app(g, c, e).
-app(g, d, e).
+app(g, d, k).
+app(g2, c, e).
+app(g2, d, e).
 
-injective(f).
-injective(g).
 compositeOf(h, g, f).
+compositeOf(h2, g2, f).
 
+% Derivation rules: each rule below contributes one logical step toward the displayed results.
+% The composite applies F first and then G.
 app(H, X, Z) :-
   compositeOf(H, G, F),
   app(F, X, Y),
   app(G, Y, Z).
 
-sameTerm(X, Y) :-
-  injective(F),
-  app(F, X, U),
-  app(F, Y, V),
-  sameTerm(U, V).
+% A collision is a witness against injectivity: two distinct inputs, one output.
+collision(F, X, Y) :-
+  app(F, X, Z),
+  app(F, Y, Z),
+  (X \= Y).
 
-sameInputByCompositeInjectivity(H, X, Y) :-
+% A function is injective in this finite model when it has no collision.
+injective(F) :-
+  function(F),
+  \+ collision(F, _, _).
+
+% The theorem instance: both parts are injective, and so is their composite.
+compositeInjective(H, G, F) :-
   compositeOf(H, G, F),
   injective(G),
   injective(F),
-  app(H, X, Z),
-  app(H, Y, Z),
-  sameTerm(X, Y),
-  (X \= Y).
+  injective(H).