npm - eyeprolog - Versions diffs - 1.6.5 → 1.6.7 - Mend

eyeprolog 1.6.5 → 1.6.7

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (1104) hide show

package/examples/abstract-interpretation.pl CHANGED Viewed

@@ -11,11 +11,11 @@
 % deliberately conservative: if the join point can see y = zero on any path, the
 % division is reported as a possible division-by-zero warning.
-%% goal: absState(X0, X1, X2)
+%% ?- absState(X0, X1, X2).
-%% goal: absWarning(X0, X1)
+%% ?- absWarning(X0, X1).
-%% goal: absConclusion(X0, X1)
+%% ?- absConclusion(X0, X1).

package/examples/access-control-policy.pl CHANGED Viewed

@@ -5,11 +5,11 @@
 % as failure over bound policy facts.
 % Output declarations: host-supplied goals select the relations written to this example's golden output.
-%% goal: policy(X0, X1)
+%% ?- policy(X0, X1).
-%% goal: status(X0, X1)
+%% ?- status(X0, X1).
-%% goal: reason(X0, X1)
+%% ?- reason(X0, X1).
 % Program structure: facts set up the scenario, and rules derive the queried conclusions.

package/examples/ackermann.pl CHANGED Viewed

@@ -6,7 +6,7 @@
 % Keeping the selected inputs explicit avoids unbounded generation while still
 % testing the solver's recursive numeric workload.
-%% goal: ackermann(X0, X1)
+%% ?- ackermann(X0, X1).
 ackermann(X, Y, A) :-

package/examples/age.pl CHANGED Viewed

@@ -5,13 +5,13 @@
 % local_time/1 fact, difference/3, and duration comparison. Declaring the date
 % as scenario data keeps the result reproducible across hosts and runs.
-%% goal: birthDay(X0, X1)
+%% ?- birthDay(X0, X1).
-%% goal: duration(X0, X1)
+%% ?- duration(X0, X1).
-%% goal: ageAbove(X0, X1)
+%% ?- ageAbove(X0, X1).
-%% goal: holds_result(X0, X1)
+%% ?- holds_result(X0, X1).
 birthDay(patH, '1944-08-21').

package/examples/aliases-and-namespaces.pl CHANGED Viewed

@@ -5,13 +5,13 @@
 %
 % This keeps the language small: arithmetic, comparison, and string operations are native,
 % while list decomposition uses ordinary Prolog pattern matching.
-%% goal: value(X0, X1)
+%% ?- value(X0, X1).
-%% goal: ok(X0, X1)
+%% ?- ok(X0, X1).
-%% goal: tail(X0, X1)
+%% ?- tail(X0, X1).
-%% goal: label(X0, X1)
+%% ?- label(X0, X1).
 % The first four rules call native built-ins; the last two rules show that

package/examples/alignment-demo.pl CHANGED Viewed

@@ -5,17 +5,17 @@
 % narrower-or-equal relation, and the concepts that roll up to ref_car.
 % Output declarations: host-supplied goals select the relations written to this example's golden output.
-%% goal: broader(X0, X1)
+%% ?- broader(X0, X1).
-%% goal: narrower(X0, X1)
+%% ?- narrower(X0, X1).
-%% goal: broaderTransitive(X0, X1)
+%% ?- broaderTransitive(X0, X1).
-%% goal: narrowerTransitive(X0, X1)
+%% ?- narrowerTransitive(X0, X1).
-%% goal: narrowerOrEqualOf(X0, X1)
+%% ?- narrowerOrEqualOf(X0, X1).
-%% goal: rollsUpTo(X0, X1)
+%% ?- rollsUpTo(X0, X1).
 % Program structure: facts set up the scenario, and rules derive the queried conclusions.

package/examples/allen-interval-calculus.pl CHANGED Viewed

@@ -7,13 +7,13 @@
 % stay scoped as one term instead of many unrelated global start/end facts.
 % Output declarations: host-supplied goals select the relations written to this example's golden output.
-%% goal: start(X0, X1)
+%% ?- start(X0, X1).
-%% goal: end(X0, X1)
+%% ?- end(X0, X1).
-%% goal: duration(X0, X1)
+%% ?- duration(X0, X1).
-%% goal: statement(X0, X1, X2)
+%% ?- statement(X0, X1, X2).
 % Program structure: facts set up the scenario, and rules derive the queried conclusions.

package/examples/ancestor.pl CHANGED Viewed

@@ -4,9 +4,9 @@
 % parent edge before continuing through the chain.  Both source and derived
 % relations are queried so the output shows the closure explicitly.
-%% goal: parent(X0, X1)
+%% ?- parent(X0, X1).
-%% goal: ancestor(X0, X1)
+%% ?- ancestor(X0, X1).
 % Direct parent facts form a simple chain.

package/examples/animal.pl CHANGED Viewed

@@ -4,11 +4,11 @@
 % same tiny inheritance idea with plain vocabulary names.
 % Output declarations: host-supplied goals select the relations written to this example's golden output.
-%% goal: type(X0, X1)
+%% ?- type(X0, X1).
-%% goal: subclassOf(X0, X1)
+%% ?- subclassOf(X0, X1).
-%% goal: succeeds(X0, X1)
+%% ?- succeeds(X0, X1).
 % Program structure: facts set up the scenario, and rules derive the queried conclusions.

package/examples/annotation.pl CHANGED Viewed

@@ -4,13 +4,13 @@
 % Context members become default output only when explicit rules project them.
 % Output declarations: host-supplied goals select the relations written to this example's golden output.
-%% goal: name(X0, X1)
+%% ?- name(X0, X1).
-%% goal: log_nameOf(X0, X1)
+%% ?- log_nameOf(X0, X1).
-%% goal: statedBy(X0, X1)
+%% ?- statedBy(X0, X1).
-%% goal: recorded(X0, X1)
+%% ?- recorded(X0, X1).
 % Program structure: facts set up the scenario, and rules derive the queried conclusions.

package/examples/attributed-variables.pl CHANGED Viewed

@@ -7,8 +7,8 @@
 :- use_module(library(atts)).
 :- attribute required/1.
-%% goal: accepts_required_value(ok)
-%% goal: alias_preserves_attribute(ok)
+%% ?- accepts_required_value(ok).
+%% ?- alias_preserves_attribute(ok).
 attach_required(Variable, Value) :-
     put_atts(Variable, required(Value)).

package/examples/auroracare.pl CHANGED Viewed

@@ -4,45 +4,45 @@
 % check values as ordinary relation output.
 % Output declarations: host-supplied goals select the relations written to this example's golden output.
-%% goal: label(X0, X1)
+%% ?- label(X0, X1).
-%% goal: description(X0, X1)
+%% ?- description(X0, X1).
-%% goal: careTeamLinked(X0, X1)
+%% ?- careTeamLinked(X0, X1).
-%% goal: subjectOptIn(X0, X1)
+%% ?- subjectOptIn(X0, X1).
-%% goal: subjectOptOut(X0, X1)
+%% ?- subjectOptOut(X0, X1).
-%% goal: decision(X0, X1)
+%% ?- decision(X0, X1).
-%% goal: reason(X0, X1)
+%% ?- reason(X0, X1).
-%% goal: matchedPolicyUid(X0, X1)
+%% ?- matchedPolicyUid(X0, X1).
-%% goal: matchedProhibition(X0, X1)
+%% ?- matchedProhibition(X0, X1).
-%% goal: trace(X0, X1)
+%% ?- trace(X0, X1).
-%% goal: checkC1(X0, X1)
+%% ?- checkC1(X0, X1).
-%% goal: checkC2(X0, X1)
+%% ?- checkC2(X0, X1).
-%% goal: checkC3(X0, X1)
+%% ?- checkC3(X0, X1).
-%% goal: checkC4(X0, X1)
+%% ?- checkC4(X0, X1).
-%% goal: checkC5(X0, X1)
+%% ?- checkC5(X0, X1).
-%% goal: checkC6(X0, X1)
+%% ?- checkC6(X0, X1).
-%% goal: checkC7(X0, X1)
+%% ?- checkC7(X0, X1).
-%% goal: checkC8(X0, X1)
+%% ?- checkC8(X0, X1).
-%% goal: checkC9(X0, X1)
+%% ?- checkC9(X0, X1).
-%% goal: checkC10Text(X0, X1)
+%% ?- checkC10Text(X0, X1).
 :- discontiguous(policyUid/2).

package/examples/backward.pl CHANGED Viewed

@@ -4,7 +4,7 @@
 % tiny: it demonstrates that a derived fact can be justified by a numeric
 % comparison in the rule body.
-%% goal: isIndeedMoreInterestingThan(X0, X1)
+%% ?- isIndeedMoreInterestingThan(X0, X1).
 moreInterestingThan(X, Y) :- (X > Y).

package/examples/basic-monadic.pl CHANGED Viewed

@@ -9,7 +9,7 @@
 % after translating N3 statements to eyeprolog relation terms.
 % Output declarations: host-supplied goals select the relations written to this example's golden output.
-%% goal: cycle(X0, X1)
+%% ?- cycle(X0, X1).
 % Program structure: facts set up the scenario, and rules derive the queried conclusions.

package/examples/bayes-diagnosis.pl CHANGED Viewed

@@ -5,17 +5,17 @@
 % in the Eyeling repository.
 % Output declarations: host-supplied goals select the relations written to this example's golden output.
-%% goal: scores(X0, X1)
+%% ?- scores(X0, X1).
-%% goal: evidenceTotal(X0, X1)
+%% ?- evidenceTotal(X0, X1).
-%% goal: result(X0, X1)
+%% ?- result(X0, X1).
-%% goal: disease(X0, X1)
+%% ?- disease(X0, X1).
-%% goal: unnormalized(X0, X1)
+%% ?- unnormalized(X0, X1).
-%% goal: posterior(X0, X1)
+%% ?- posterior(X0, X1).
 % Program structure: facts set up the scenario, and rules derive the queried conclusions.

package/examples/bayes-therapy.pl CHANGED Viewed

@@ -14,27 +14,27 @@
 % probabilities from symptoms, then score each therapy by averaging outcomes
 % over that posterior distribution. The recursive predicates are
 % shared layers used by several queried reports.
-%% goal: diseases(X0, X1)
+%% ?- diseases(X0, X1).
-%% goal: therapies(X0, X1)
+%% ?- therapies(X0, X1).
-%% goal: evidence(X0, X1)
+%% ?- evidence(X0, X1).
-%% goal: scores(X0, X1)
+%% ?- scores(X0, X1).
-%% goal: evidenceTotal(X0, X1)
+%% ?- evidenceTotal(X0, X1).
-%% goal: posteriors(X0, X1)
+%% ?- posteriors(X0, X1).
-%% goal: posterior(X0, X1)
+%% ?- posterior(X0, X1).
-%% goal: expectedSuccess(X0, X1)
+%% ?- expectedSuccess(X0, X1).
-%% goal: expectedAdverse(X0, X1)
+%% ?- expectedAdverse(X0, X1).
-%% goal: utility(X0, X1)
+%% ?- utility(X0, X1).
-%% goal: recommendedTherapy(X0, X1)
+%% ?- recommendedTherapy(X0, X1).
 % Program structure: facts set up the scenario, and rules derive the queried conclusions.

package/examples/beam-deflection.pl CHANGED Viewed

@@ -3,15 +3,15 @@
 % of area.  The rules compute F*L^3/(3*E*I), convert meters to millimeters, and
 % classify the design against a deflection limit.
-%% goal: type(X0, X1)
+%% ?- type(X0, X1).
-%% goal: tipDeflection_m(X0, X1)
+%% ?- tipDeflection_m(X0, X1).
-%% goal: tipDeflection_mm(X0, X1)
+%% ?- tipDeflection_mm(X0, X1).
-%% goal: limit_mm(X0, X1)
+%% ?- limit_mm(X0, X1).
-%% goal: status(X0, X1)
+%% ?- status(X0, X1).
 beam(beam1, force_N, 1200.0).

package/examples/bench.pl CHANGED Viewed

@@ -10,7 +10,7 @@
 % Source/history:
 % https://gerrit.googlesource.com/prolog-cafe/+/73b5ce4f5fbef086a22de3292a53e1ffe2947fab/examples/benchmarks/src/bench.pl
-%% goal: bench_result(X0)
+%% ?- bench_result(X0).
 nrev([], []).
 nrev([X|Rest], Ans) :-

package/examples/binomial-vandermonde.pl CHANGED Viewed

@@ -11,7 +11,7 @@
 % choose_step/5 uses the multiplicative recurrence
 %   C(N, I+1) = C(N, I) * (N-I) / (I+1)
 % and is explicitly tabled because row sums and identities reuse prefixes.
-%% goal: binomial_answer(X0, X1)
+%% ?- binomial_answer(X0, X1).

package/examples/blocks-world-planning.pl CHANGED Viewed

@@ -7,13 +7,13 @@
 % checks are purely structural.
 % Output declarations: host-supplied goals select the relations written to this example's golden output.
-%% goal: status(X0, X1)
+%% ?- status(X0, X1).
-%% goal: plan(X0, X1)
+%% ?- plan(X0, X1).
-%% goal: finalState(X0, X1)
+%% ?- finalState(X0, X1).
-%% goal: blockCount(X0, X1)
+%% ?- blockCount(X0, X1).
 % The initial and goal states are lists of on/2 facts.  Sorting successor states

package/examples/bmi.pl CHANGED Viewed

@@ -8,67 +8,67 @@
 % Editable metric input.
 % Output declarations: host-supplied goals select the relations written to this example's golden output.
-%% goal: unitSystem(X0, X1)
+%% ?- unitSystem(X0, X1).
-%% goal: weight(X0, X1)
+%% ?- weight(X0, X1).
-%% goal: height(X0, X1)
+%% ?- height(X0, X1).
-%% goal: weightKg(X0, X1)
+%% ?- weightKg(X0, X1).
-%% goal: heightM(X0, X1)
+%% ?- heightM(X0, X1).
-%% goal: units(X0, X1)
+%% ?- units(X0, X1).
-%% goal: heightSquared(X0, X1)
+%% ?- heightSquared(X0, X1).
-%% goal: bmi(X0, X1)
+%% ?- bmi(X0, X1).
-%% goal: bmiRoundedInt(X0, X1)
+%% ?- bmiRoundedInt(X0, X1).
-%% goal: healthyMinKg(X0, X1)
+%% ?- healthyMinKg(X0, X1).
-%% goal: healthyMaxKg(X0, X1)
+%% ?- healthyMaxKg(X0, X1).
-%% goal: healthyMinKgRoundedInt(X0, X1)
+%% ?- healthyMinKgRoundedInt(X0, X1).
-%% goal: healthyMaxKgRoundedInt(X0, X1)
+%% ?- healthyMaxKgRoundedInt(X0, X1).
-%% goal: category(X0, X1)
+%% ?- category(X0, X1).
-%% goal: heightCm(X0, X1)
+%% ?- heightCm(X0, X1).
-%% goal: formula(X0, X1)
+%% ?- formula(X0, X1).
-%% goal: calculation(X0, X1)
+%% ?- calculation(X0, X1).
-%% goal: categoryRule(X0, X1)
+%% ?- categoryRule(X0, X1).
-%% goal: unitsExplanation(X0, X1)
+%% ?- unitsExplanation(X0, X1).
-%% goal: c1(X0, X1)
+%% ?- c1(X0, X1).
-%% goal: c2(X0, X1)
+%% ?- c2(X0, X1).
-%% goal: c3(X0, X1)
+%% ?- c3(X0, X1).
-%% goal: c4(X0, X1)
+%% ?- c4(X0, X1).
-%% goal: c5(X0, X1)
+%% ?- c5(X0, X1).
-%% goal: c6(X0, X1)
+%% ?- c6(X0, X1).
-%% goal: c7(X0, X1)
+%% ?- c7(X0, X1).
-%% goal: c8(X0, X1)
+%% ?- c8(X0, X1).
-%% goal: c9(X0, X1)
+%% ?- c9(X0, X1).
-%% goal: result(X0, X1)
+%% ?- result(X0, X1).
-%% goal: healthyWeightRangeKg(X0, X1)
+%% ?- healthyWeightRangeKg(X0, X1).
-%% goal: checkPassed(X0, X1)
+%% ?- checkPassed(X0, X1).
 :- discontiguous(weightKg/2).

package/examples/braking-safety-worlds.pl CHANGED Viewed

@@ -4,13 +4,13 @@
 % real safety calculator; it demonstrates rule-level model comparison.
 % Output declarations: host-supplied goals select the relations written to this example's golden output.
-%% goal: safeInWorld(X0, X1)
+%% ?- safeInWorld(X0, X1).
-%% goal: riskyInWorld(X0, X1)
+%% ?- riskyInWorld(X0, X1).
-%% goal: status(X0, X1)
+%% ?- status(X0, X1).
-%% goal: reason(X0, X1)
+%% ?- reason(X0, X1).
 % Program structure: facts set up the scenario, and rules derive the queried conclusions.

package/examples/buck-converter-design.pl CHANGED Viewed

@@ -8,17 +8,17 @@
 % The constants describe one regulator design. The rules intentionally keep
 % each engineering equation separate so proof output can point to the exact
 % calculation that made the design pass or fail.
-%% goal: dutyCycle(X0, X1)
+%% ?- dutyCycle(X0, X1).
-%% goal: inductorRipple_A(X0, X1)
+%% ?- inductorRipple_A(X0, X1).
-%% goal: rippleRatio(X0, X1)
+%% ?- rippleRatio(X0, X1).
-%% goal: capacitorRipple_V(X0, X1)
+%% ?- capacitorRipple_V(X0, X1).
-%% goal: status(X0, X1)
+%% ?- status(X0, X1).
-%% goal: reason(X0, X1)
+%% ?- reason(X0, X1).
 % Program structure: facts set up the scenario, and rules derive the queried conclusions.

package/examples/bulk-stream-write.pl CHANGED Viewed

@@ -9,7 +9,7 @@
 % character round-trips. The path is under /tmp so the source tree is
 % unchanged.
-%% goal: bulk_write_result(X0, X1)
+%% ?- bulk_write_result(X0, X1).
 bulk_write_chars(_, 0) :- !.
 bulk_write_chars(Stream, N) :-

package/examples/cache-performance.pl CHANGED Viewed

@@ -5,13 +5,13 @@
 % the cache is effective.
 % Output declarations: host-supplied goals select the relations written to this example's golden output.
-%% goal: hitRate(X0, X1)
+%% ?- hitRate(X0, X1).
-%% goal: averageLatency_ms(X0, X1)
+%% ?- averageLatency_ms(X0, X1).
-%% goal: status(X0, X1)
+%% ?- status(X0, X1).
-%% goal: reason(X0, X1)
+%% ?- reason(X0, X1).
 % cache_sample/5 contains hits, misses, and the two latency classes; threshold/3

package/examples/canary-release.pl CHANGED Viewed

@@ -4,15 +4,15 @@
 % allowed budget, even when latency is still acceptable.
 % Output declarations: host-supplied goals select the relations written to this example's golden output.
-%% goal: errorRate(X0, X1)
+%% ?- errorRate(X0, X1).
-%% goal: p95Latency_ms(X0, X1)
+%% ?- p95Latency_ms(X0, X1).
-%% goal: latencyCheck(X0, X1)
+%% ?- latencyCheck(X0, X1).
-%% goal: status(X0, X1)
+%% ?- status(X0, X1).
-%% goal: reason(X0, X1)
+%% ?- reason(X0, X1).
 % canary/4 records request count, error count, and p95 latency; thresholds

package/examples/cat-koko.pl CHANGED Viewed

@@ -5,9 +5,9 @@
 % witnesses sk_0 and sk_1.
 % Output declarations: host-supplied goals select the relations written to this example's golden output.
-%% goal: type(X0, X1)
+%% ?- type(X0, X1).
-%% goal: holds_result(X0, X1)
+%% ?- holds_result(X0, X1).
 % Program structure: facts set up the scenario, and rules derive the queried conclusions.

package/examples/catalan-convolution.pl CHANGED Viewed

@@ -8,7 +8,7 @@
 % 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
 % triangulations, shown here with small wrapper predicates.
-%% goal: catalan_answer(X0, X1)
+%% ?- catalan_answer(X0, X1).

package/examples/cdcl-sat-solver.pl CHANGED Viewed

@@ -16,7 +16,7 @@
 % reason c1 with the conflict c2 learns not(a).  After backjumping, learned
 % not(a) forces a=false, c2 gives c=false, and c3 forces b=true.
-%% goal: cdclAnswer(X0, X1)
+%% ?- cdclAnswer(X0, X1).
 sat_clause(c1, [neg(a), pos(c)]).

package/examples/chart-parser.pl CHANGED Viewed

@@ -8,7 +8,7 @@
 % span(Sentence, Category, Start, End) is the dynamic-programming chart item:
 % Category covers a half-open token interval.  Memoizing span/4 turns recursive
 % grammar recognition into chart parsing, so ambiguous phrases share subparses.
-%% goal: chart_parser_answer(X0, X1)
+%% ?- chart_parser_answer(X0, X1).

package/examples/clinical-trial-screening.pl CHANGED Viewed

@@ -9,11 +9,11 @@
 % Inclusion criteria are positive requirements; exclusion criteria veto a
 % candidate even when the inclusion checks pass. The emitted reason/2 facts are
 % the audit trail a coordinator would need for a screen-failure report.
-%% goal: type(X0, X1)
+%% ?- type(X0, X1).
-%% goal: status(X0, X1)
+%% ?- status(X0, X1).
-%% goal: reason(X0, X1)
+%% ?- reason(X0, X1).
 % Program structure: facts set up the scenario, and rules derive the queried conclusions.

package/examples/clpb-boolean-circuit.pl CHANGED Viewed

@@ -4,8 +4,8 @@
 % complete truth table; the second uses universally quantified Boolean atoms
 % and taut/2 to verify equivalence to the XOR (#) specification.
-%% goal: xor_row(X0)
-%% goal: xor_circuit_verified(X0)
+%% ?- xor_row(X0).
+%% ?- xor_circuit_verified(X0).
 xor_circuit(X, Y, Z) :-
   sat(Z =:= ((X * ~Y) + (~X * Y))).