eyeprolog 1.4.10 → 1.5.1

package/README.md

@@ -58,6 +58,13 @@ printf 'human(socrates).\nmortal(X) :- human(X).\n' |
   npx --yes eyeprolog --proof --goal 'mortal(socrates)' -
 ```
 
+## Native forward rules (`:+`)
+
+Normal mode executes top-level `Conclusion :+ Premise` rules natively when no explicit
+`-g/--goal` is supplied. `true :+ Goal` prints answers and `false :+ Goal` emits a
+`fuse/1`; JavaScript `run()` follows the same rule. Strict ISO mode disables this
+extension. See [*The Art of EyeProlog*](the-art-of-eyeprolog.md) for the full semantics.
+
 ## Links
 
 - [The Art of EyeProlog](https://eyereasoner.github.io/eyeprolog/the-art-of-eyeprolog) — complete reference

package/conformance-report.md

@@ -21,10 +21,10 @@ spelling therefore changes this report even when no corpus file is added or remo
 | aggregation | 17 | 0 | 0 | 0 | 17 |
 | arithmetic | 38 | 0 | 0 | 0 | 38 |
 | atoms | 23 | 8 | 0 | 0 | 31 |
-| automatic-tabling | 6 | 0 | 0 | 0 | 6 |
 | builtins | 11 | 0 | 0 | 0 | 11 |
 | context | 11 | 0 | 0 | 0 | 11 |
 | control | 15 | 0 | 0 | 0 | 15 |
+| explicit-tabling | 6 | 0 | 0 | 0 | 6 |
 | iso | 169 | 217 | 0 | 0 | 386 |
 | lists | 52 | 3 | 0 | 0 | 55 |
 | modules | 2 | 0 | 0 | 0 | 2 |

package/examples/bayes-diagnosis.pl

@@ -96,10 +96,10 @@ score_decimal(bacterialPneumonia, 0.000047879999999999996).
 
 total_score_decimal(0.0016436300000000003).
 
-posterior(covid19, 0.9412093962753174).
-posterior(influenza, 0.029203652890249024).
-posterior(allergicRhinitis, 0.00045630707641014084).
-posterior(bacterialPneumonia, 0.029130643758023392).
+posterior_decimal(covid19, 0.9412093962753174).
+posterior_decimal(influenza, 0.029203652890249024).
+posterior_decimal(allergicRhinitis, 0.00045630707641014084).
+posterior_decimal(bacterialPneumonia, 0.029130643758023392).
 
 scores(case, [
   0.0015470000000000002,
@@ -111,4 +111,4 @@ evidenceTotal(case, Total) :- total_score_decimal(Total).
 result(case, result(Disease)) :- disease(Disease).
 disease(result(Disease), Disease) :- disease(Disease).
 unnormalized(result(Disease), Score) :- score_decimal(Disease, Score).
-posterior(result(Disease), Posterior) :- posterior(Disease, Posterior).
+posterior(result(Disease), Posterior) :- posterior_decimal(Disease, Posterior).

package/examples/bayes-therapy.pl

@@ -1,3 +1,11 @@
+:- table likelihood/3.
+:- table scores_for/2.
+:- table score_sum/2.
+:- table normalize_scores/3.
+:- table disease_posterior/4.
+:- table dot_product/3.
+:- table best_therapy/2.
+
 % Memoize shared inference layers: the score vector, disease likelihood tails,
 % and expected therapy success are reused by several report relations.
 % Output declarations: host-supplied goals select the relations written to this example's golden output.
@@ -145,8 +153,8 @@ expected_success(Therapy, Expectedsuccess) :-
   success_by_disease(Therapy, Successbydisease),
   dot_product(Posteriors, Successbydisease, Expectedsuccess).
 
-% utility/2 turns expected success and adverse effects into a ranking score.
-utility(Therapy, Utility) :-
+% therapy_utility/2 turns expected success and adverse effects into a ranking score.
+therapy_utility(Therapy, Utility) :-
   expected_success(Therapy, Expectedsuccess),
   adverse(Therapy, Adverse),
   benefit_weight(Benefitweight),
@@ -156,12 +164,12 @@ utility(Therapy, Utility) :-
   (Utility is Benefit - Harmcost).
 
 better_of(Therapy1, Therapy2, Therapy1) :-
-  utility(Therapy1, Utility1),
-  utility(Therapy2, Utility2),
+  therapy_utility(Therapy1, Utility1),
+  therapy_utility(Therapy2, Utility2),
   (Utility1 >= Utility2).
 better_of(Therapy1, Therapy2, Therapy2) :-
-  utility(Therapy1, Utility1),
-  utility(Therapy2, Utility2),
+  therapy_utility(Therapy1, Utility1),
+  therapy_utility(Therapy2, Utility2),
   (Utility1 < Utility2).
 
 best_therapy([Therapy], Therapy).
@@ -191,7 +199,7 @@ expectedAdverse(Therapy, Adverse) :-
   adverse(Therapy, Adverse).
 utility(Therapy, Utility) :-
   therapy(Therapy),
-  utility(Therapy, Utility).
+  therapy_utility(Therapy, Utility).
 recommendedTherapy(case, Best) :-
   therapies(case, Therapies),
   best_therapy(Therapies, Best).

package/examples/binomial-vandermonde.pl

@@ -1,6 +1,8 @@
 :- use_module(library(aggregate)).
 :- use_module(library(between), [between/3]).
 
+:- table choose_step/5.
+
 % Binomial coefficients and Vandermonde's identity.
 %
 % choose(N,K,C) is computed by a multiplicative recurrence, then vandermonde/5 checks
@@ -8,7 +10,7 @@
 % the binomial-row prefixes shared across both sides of the identity.
 % choose_step/5 uses the multiplicative recurrence
 %   C(N, I+1) = C(N, I) * (N-I) / (I+1)
-% and is cached automatically because row sums and identities reuse prefixes.
+% and is explicitly tabled because row sums and identities reuse prefixes.
 %% goal: binomial_answer(X0, X1)
 
 

package/examples/book/chapter-04/01-ancestor.pl

@@ -1,3 +1,5 @@
 % From The Art of EyeProlog, Chapter 4.
+:- table ancestor/2.
+
 ancestor(X, Y) :- parent(X, Y).
 ancestor(X, Z) :- parent(X, Y), ancestor(Y, Z).

package/examples/catalan-convolution.pl

@@ -1,7 +1,9 @@
 :- use_module(library(aggregate)).
 :- use_module(library(between), [between/3]).
 
-% Catalan numbers by automatically tabled convolution.
+:- table catalan/2.
+
+% Catalan numbers by explicitly tabled convolution.
 %
 % catalan(N,C) sums all splits of N-1 into left and right substructures.  The same
 % Catalan values appear in binary tree shapes, parenthesizations, and polygon

package/examples/chart-parser.pl

@@ -1,7 +1,9 @@
 :- use_module(library(lists)).
 :- use_module(library(iso_ext)).
 
-% A tiny automatically tabled chart parser for a context-free grammar.
+:- table span/4.
+
+% A tiny explicitly tabled chart parser for a context-free grammar.
 %
 % span(Sentence, Category, Start, End) is the dynamic-programming chart item:
 % Category covers a half-open token interval.  Memoizing span/4 turns recursive

package/examples/collatz-1000.pl

@@ -1,5 +1,7 @@
 :- use_module(library(between), [between/3]).
 
+:- table collatz/2.
+
 % Collatz conjecture suite translated from Eyeling's examples/collatz-1000.n3.
 % It enumerates starts N = 1000, 999, ..., 1 by deriving N = 1000 - N0
 % from a repeat relation, then querys each full trajectory.
@@ -8,7 +10,7 @@
 % https://raw.githubusercontent.com/eyereasoner/eyeling/refs/heads/main/examples/collatz-1000.n3
 
 % Output declarations: host-supplied goals select the relations written to this example's golden output.
-% Automatic tabling caches shared suffix trajectories so the 1000 starts do not recompute
+% Explicit tabling caches shared suffix trajectories so the 1000 starts do not recompute
 % the same Collatz tails hundreds of times.
 %% goal: collatzTrajectory(X0, X1)
 

package/examples/continued-fraction-sqrt2.pl

@@ -1,7 +1,9 @@
 :- use_module(library(aggregate)).
 :- use_module(library(between), [between/3]).
 
-% Convergents of sqrt(2) by automatically tabled recurrence.
+:- table conv/3.
+
+% Convergents of sqrt(2) by explicitly tabled recurrence.
 %
 % conv(N, P, Q) gives the Nth numerator/denominator pair for [1; 2, 2, ...].
 % Because each convergent depends on the previous two, memoization avoids the

package/examples/critical-path-schedule.pl

@@ -1,5 +1,8 @@
 :- use_module(library(aggregate)).
 
+:- table earliest_start/2.
+:- table finish_time/2.
+
 % Critical-path scheduling for a small project network.
 %
 % earliest_start/2 is the maximum finish time over all predecessors; finish_time/2

package/examples/cyclic-path.pl

@@ -1,3 +1,5 @@
+:- table path/2.
+
 % Cyclic transitive closure.
 %
 % The graph deliberately contains the directed cycle a -> b -> c -> d -> a.  The

package/examples/dijkstra-findall-sort.pl

@@ -1,4 +1,5 @@
 :- use_module(library(lists)).
+:- table edge/3.
 
 % Eyelet-inspired Dijkstra example using findall/3 and sort/2.
 % The priority queue is represented as sorted list entries [Cost, Node | Path].

package/examples/enigma1225.pl

@@ -1,13 +1,15 @@
 :- use_module(library(aggregate)).
 :- use_module(library(lists)).
 
+:- table generator/2.
+
 % New Scientist puzzle Enigma 1225
 % Original code from https://www.sciencedirect.com/science/article/pii/S0898122106002057
 %
 % The maximum is retained in one pass with aggregate_max/5.  The recursive
 % helpers below are deterministic in the modes used by square/5; their cuts
-% make that operational contract explicit and keep automatic tabling for the
-% genuinely generative partition relation only.
+% make that operational contract explicit; the genuinely generative partition
+% relation opts into tabling with an explicit table declaration.
 
 enigma1225(Size, [Permutation, Board, Max]) :-
     aggregate_max(Total, board(M, Perm),

package/examples/equality-saturation.pl

@@ -2,6 +2,9 @@
 :- use_module(library(between), [between/3]).
 :- use_module(library(lists)).
 :- use_module(library(iso_ext)).
+:- table rewrite_anywhere/2.
+:- table equivalent_at_depth/3.
+:- table expr_cost/2.
 
 % Bounded equality saturation over tiny arithmetic expression terms.
 %

package/examples/fibonacci.pl

@@ -1,3 +1,5 @@
+:- table fib_pair/3.
+
 % Fibonacci numbers by fast doubling.
 %
 % The public fibonacci/2 relation is bounded by fib_case/1 facts, while fib_pair/3

package/examples/fundamental-theorem-arithmetic.pl

@@ -1,5 +1,6 @@
 :- use_module(library(primes)).
 :- use_module(library(lists)).
+:- table factor_smallest/2.
 
 % Adapted from Eyeling's fundamental-theorem-arithmetic.n3.
 % Compute a prime factorization by repeated smallest-divisor decomposition,
@@ -72,9 +73,9 @@ factor_largest(N, Factors) :-
   factor_smallest(N, Smallest),
   reverse(Smallest, Factors).
 
-product([], 1).
-product([X|Rest], P) :-
-  product(Rest, P0),
+factor_product([], 1).
+factor_product([X|Rest], P) :-
+  factor_product(Rest, P0),
   (P is X * P0).
 
 all_expected_primes(true) :-
@@ -97,7 +98,7 @@ factorsLargest(case, Factors) :-
 product(case, Product) :-
   case(fta, N),
   factor_smallest(N, Factors),
-  product(Factors, Product).
+  factor_product(Factors, Product).
 
 expectedFactorsMatched(case, true) :-
   case(fta, N),
@@ -107,7 +108,7 @@ expectedFactorsMatched(case, true) :-
 productReconstructsInput(case, true) :-
   case(fta, N),
   factor_smallest(N, Factors),
-  product(Factors, N).
+  factor_product(Factors, N).
 
 distinctPrimeCount(case, 4) :-
   all_expected_primes(true).

package/examples/illegitimate-reasoning.pl

@@ -27,7 +27,7 @@
 :- discontiguous(implication/3).
 :- discontiguous(observed/2).
 :- discontiguous(concludes/2).
-:- discontiguous(reason/2).
+:- discontiguous(reason_fact/2).
 
 % Program structure: facts set up the scenario, and rules derive the queried conclusions.
 argument(arg_affirming_consequent).
@@ -88,14 +88,14 @@ fallacy(A, false_dilemma) :-
   omitted_alternative(A, _),
   concludes(A, _).
 
-reason(arg_affirming_consequent, "observing the consequent does not prove the antecedent").
-reason(arg_denying_antecedent, "denying the antecedent does not disprove the consequent").
-reason(arg_hasty_generalization, "sample size is below the threshold for a universal conclusion").
-reason(arg_false_dilemma, "a relevant alternative is omitted").
+reason_fact(arg_affirming_consequent, "observing the consequent does not prove the antecedent").
+reason_fact(arg_denying_antecedent, "denying the antecedent does not disprove the consequent").
+reason_fact(arg_hasty_generalization, "sample size is below the threshold for a universal conclusion").
+reason_fact(arg_false_dilemma, "a relevant alternative is omitted").
 
 type(A, illegitimate_reasoning) :- fallacy(A, _).
 conclusion(A, C) :- fallacy(A, _), concludes(A, C).
-reason(A, R) :- fallacy(A, _), reason(A, R).
+reason(A, R) :- fallacy(A, _), reason_fact(A, R).
 sampleSize(A, N) :- fallacy(A, hasty_generalization), sample_size(A, N).
 requiredSampleSize(A, Min) :- fallacy(A, hasty_generalization), required_sample_size(A, Min).
 omittedAlternative(A, Alt) :- fallacy(A, false_dilemma), omitted_alternative(A, Alt).

package/examples/integer-partitions.pl

@@ -1,6 +1,8 @@
 :- use_module(library(aggregate)).
 :- use_module(library(between), [between/3]).
 
+:- table partitions/3.
+
 % Integer partition counts by tabled dynamic programming.
 %
 % partitions(N, K, Count) counts unordered sums of N using parts no larger than K.

package/examples/knowledge-engineering-alignment-flow.pl

@@ -29,8 +29,8 @@ sub_property(temperature_celsius, sosa_hasSimpleResult).
 sub_property(in_flow, fpv_hasFlowStep).
 equivalent_property(observed_feature, sosa_hasFeatureOfInterest).
 
-type(msg1, local_observation).
-type(probe7, temperature_probe).
+base_type(msg1, local_observation).
+base_type(probe7, temperature_probe).
 triple(msg1, observed_by, probe7).
 triple(msg1, observed_at, "2026-06-17T12:34:56Z").
 triple(msg1, temperature_celsius, 18.6).
@@ -38,7 +38,11 @@ triple(msg1, observed_feature, platform_b).
 triple(msg1, in_flow, ingest_step).
 
 % Generic alignment rules.
-type(Thing, Super) :- type(Thing, Class), sub_class(Class, Super).
+type(Thing, Class) :- base_type(Thing, Class).
+type(Thing, Super) :- base_type(Thing, Class), sub_class_of(Class, Super).
+
+sub_class_of(Class, Super) :- sub_class(Class, Super).
+sub_class_of(Class, Super) :- sub_class(Class, Middle), sub_class_of(Middle, Super).
 target_fact(Subject, Superpredicate, Object) :- triple(Subject, Predicate, Object), sub_property(Predicate, Superpredicate).
 target_fact(Subject, Targetpredicate, Object) :- triple(Subject, Predicate, Object), equivalent_property(Predicate, Targetpredicate).
 target_fact(Subject, Sourcepredicate, Object) :- triple(Subject, Predicate, Object), equivalent_property(Sourcepredicate, Predicate).

package/examples/language.pl

@@ -1,9 +1,11 @@
+:- table path/2.
+
 % EyeProlog language-identity example.
 %
 % This file intentionally uses the modern EyeProlog surface syntax:
 %   - `.pl` source files instead of Prolog `.pl` files
 %   - ISO Prolog-style uppercase variables
-%   - automatic tabling for recursive predicates
+%   - explicit `table/1` declarations for tabled predicates
 %   - quoted angle-bracket atoms for web-shaped identifiers
 
 %% goal: path(X0, X1)

package/examples/matrix-chain-order.pl

@@ -3,7 +3,9 @@
 :- use_module(library(lists)).
 :- use_module(library(iso_ext)).
 
-% Matrix-chain multiplication order by automatically tabled interval dynamic programming.
+:- table cost/3.
+
+% Matrix-chain multiplication order by explicitly tabled interval dynamic programming.
 %
 % cost(I, J, Cost) is the minimum scalar multiplication cost for matrices I..J.
 % best_split/3 records which split obtains that cost, and parenthesization/3

package/examples/modular-exponentiation.pl

@@ -1,3 +1,5 @@
+:- table pow_mod/4.
+
 % Modular exponentiation by repeated squaring.
 %
 % pow_mod(Base, Exp, Modulus, Result) uses the even/odd exponent split, giving

package/examples/output/bayes-diagnosis.pl

@@ -11,3 +11,7 @@ unnormalized(result(covid19), 0.0015470000000000002).
 unnormalized(result(influenza), 0.000048000000000000015).
 unnormalized(result(allergicRhinitis), 7.499999999999999e-7).
 unnormalized(result(bacterialPneumonia), 0.000047879999999999996).
+posterior(result(covid19), 0.9412093962753174).
+posterior(result(influenza), 0.029203652890249024).
+posterior(result(allergicRhinitis), 0.00045630707641014084).
+posterior(result(bacterialPneumonia), 0.029130643758023392).

package/examples/output/bayes-therapy.pl

@@ -1,8 +1,3 @@
-utility(paxlovid, 3.5851740117076503).
-utility(oseltamivir, 2.6114101258814744).
-utility(antihistamine, 0.91268919364852963).
-utility(antibiotic, 0.89952579796093612).
-utility(supportiveCare, 2.8851195397013814).
 scores(case, [0.0092820000000000021, 0.008208, 0.00012824999999999997, 0.00156408]).
 evidenceTotal(case, 0.019182330000000004).
 posteriors(case, [0.48388282341092037, 0.42789379600913957, 0.0066858405626428041, 0.081537540017297155]).
@@ -20,4 +15,9 @@ expectedAdverse(oseltamivir, 0.08).
 expectedAdverse(antihistamine, 0.03).
 expectedAdverse(antibiotic, 0.07).
 expectedAdverse(supportiveCare, 0.01).
+utility(paxlovid, 3.5851740117076503).
+utility(oseltamivir, 2.6114101258814744).
+utility(antihistamine, 0.91268919364852963).
+utility(antibiotic, 0.89952579796093612).
+utility(supportiveCare, 2.8851195397013814).
 recommendedTherapy(case, paxlovid).

package/examples/output/fundamental-theorem-arithmetic.pl

@@ -1,7 +1,7 @@
-product(case, 202692987).
 n(case, 202692987).
 factorsSmallest(case, [3, 3, 7, 829, 3881]).
 factorsLargest(case, [3881, 829, 7, 3, 3]).
+product(case, 202692987).
 expectedFactorsMatched(case, true).
 productReconstructsInput(case, true).
 distinctPrimeCount(case, 4).

package/examples/output/illegitimate-reasoning.pl

@@ -10,6 +10,10 @@ conclusion(arg_affirming_consequent, rain).
 conclusion(arg_denying_antecedent, neg(door_opens)).
 conclusion(arg_hasty_generalization, all(crows, black)).
 conclusion(arg_false_dilemma, approve_now).
+reason(arg_affirming_consequent, "observing the consequent does not prove the antecedent").
+reason(arg_denying_antecedent, "denying the antecedent does not disprove the consequent").
+reason(arg_hasty_generalization, "sample size is below the threshold for a universal conclusion").
+reason(arg_false_dilemma, "a relevant alternative is omitted").
 sampleSize(arg_hasty_generalization, 3).
 requiredSampleSize(arg_hasty_generalization, 30).
 omittedAlternative(arg_false_dilemma, revise_proposal).

package/examples/output/knowledge-engineering-alignment-flow.pl

@@ -1,3 +1,7 @@
+type(msg1, local_observation).
+type(probe7, temperature_probe).
+type(msg1, sosa_observation).
+type(probe7, sosa_sensor).
 target_fact(msg1, sosa_madeBySensor, probe7).
 target_fact(msg1, sosa_resultTime, "2026-06-17T12:34:56Z").
 target_fact(msg1, sosa_hasSimpleResult, 18.6).

package/examples/output/peano-arithmetic.pl

@@ -1,3 +1 @@
-factorial(0, s(0)).
-factorial(s(0), s(0)).
 factorial(s(s(s(s(s(0))))), s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(0))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))).

package/examples/peano-arithmetic.pl

@@ -20,7 +20,7 @@ peano_multiply(A, s(B), C) :-
   peano_multiply(A, B, D),
   peano_add(A, D, C).
 
-factorial(A, B) :-
+factorial_value(A, B) :-
   fac(A, s(0), B).
 
 fac(0, A, A).
@@ -31,4 +31,4 @@ fac(s(A), B, C) :-
 factorial(B, C) :-
   peano_multiply(s(0), s(s(0)), A),
   peano_add(A, s(s(s(0))), B),
-  factorial(B, C).
+  factorial_value(B, C).

package/examples/pell-equation.pl

@@ -1,7 +1,9 @@
 :- use_module(library(aggregate)).
 :- use_module(library(between), [between/3]).
 
-% Pell equation x^2 - 2y^2 = 1 by automatically tabled recurrence.
+:- table pell/3.
+
+% Pell equation x^2 - 2y^2 = 1 by explicitly tabled recurrence.
 %
 % The fundamental solution (3,2) induces a linear recurrence for all positive
 % solutions of x^2 - 2y^2 = 1.  The example querys later solutions and also

package/examples/proof/bayes-diagnosis.pl

@@ -206,3 +206,67 @@ why(
   )
 ).
 
+posterior(result(covid19), 0.9412093962753174).
+why(
+  posterior(result(covid19), 0.9412093962753174),
+  proof(
+    goal(posterior(result(covid19), 0.9412093962753174)),
+    by(rule("bayes-diagnosis.pl", clause(50))),
+    bindings([binding("Disease", covid19), binding("Posterior", 0.9412093962753174)]),
+    uses([
+      proof(
+        goal(posterior_decimal(covid19, 0.9412093962753174)),
+        by(fact("bayes-diagnosis.pl", clause(41)))
+      )
+    ])
+  )
+).
+
+posterior(result(influenza), 0.029203652890249024).
+why(
+  posterior(result(influenza), 0.029203652890249024),
+  proof(
+    goal(posterior(result(influenza), 0.029203652890249024)),
+    by(rule("bayes-diagnosis.pl", clause(50))),
+    bindings([binding("Disease", influenza), binding("Posterior", 0.029203652890249024)]),
+    uses([
+      proof(
+        goal(posterior_decimal(influenza, 0.029203652890249024)),
+        by(fact("bayes-diagnosis.pl", clause(42)))
+      )
+    ])
+  )
+).
+
+posterior(result(allergicRhinitis), 0.00045630707641014084).
+why(
+  posterior(result(allergicRhinitis), 0.00045630707641014084),
+  proof(
+    goal(posterior(result(allergicRhinitis), 0.00045630707641014084)),
+    by(rule("bayes-diagnosis.pl", clause(50))),
+    bindings([binding("Disease", allergicRhinitis), binding("Posterior", 0.00045630707641014084)]),
+    uses([
+      proof(
+        goal(posterior_decimal(allergicRhinitis, 0.00045630707641014084)),
+        by(fact("bayes-diagnosis.pl", clause(43)))
+      )
+    ])
+  )
+).
+
+posterior(result(bacterialPneumonia), 0.029130643758023392).
+why(
+  posterior(result(bacterialPneumonia), 0.029130643758023392),
+  proof(
+    goal(posterior(result(bacterialPneumonia), 0.029130643758023392)),
+    by(rule("bayes-diagnosis.pl", clause(50))),
+    bindings([binding("Disease", bacterialPneumonia), binding("Posterior", 0.029130643758023392)]),
+    uses([
+      proof(
+        goal(posterior_decimal(bacterialPneumonia, 0.029130643758023392)),
+        by(fact("bayes-diagnosis.pl", clause(44)))
+      )
+    ])
+  )
+).
+