eyelang 4.0.6 → 4.0.7

package/README.md

@@ -7,6 +7,10 @@ Eyelang is a small reasoning language for turning facts and rules into answers a
 
 Prolog-like syntax. Small core. Inspectable results.
 
+Its default execution is automatically hybrid: ordinary goals use indexed
+depth-first resolution, while recursive helper predicate groups are detected
+and tabled automatically.
+
 ## Install and run
 
 Eyelang has no runtime npm dependencies and no build step. From a source checkout, run the CLI directly with Node.js 18 or newer:

package/bin/eyelang.js

@@ -1,7 +1,7 @@
 #!/usr/bin/env node
 import { main } from '../src/cli.js';
 
-main(process.argv.slice(2)).catch((error) => {
+await main(process.argv.slice(2)).catch((error) => {
   console.error(`eyelang: ${error && error.message ? error.message : String(error)}`);
   process.exit(1);
 });

package/conformance-report.md

@@ -7,10 +7,11 @@ This report summarizes the file-based conformance corpus under `test/conformance
 | aggregation | 17 | 0 | 0 | 0 | 17 |
 | arithmetic | 40 | 0 | 0 | 0 | 40 |
 | atoms | 22 | 8 | 0 | 0 | 30 |
+| automatic-tabling | 6 | 0 | 0 | 0 | 6 |
 | builtins | 10 | 0 | 0 | 0 | 10 |
 | context | 11 | 0 | 0 | 0 | 11 |
 | control | 15 | 0 | 0 | 0 | 15 |
-| declarations | 6 | 0 | 0 | 0 | 6 |
+| declarations | 5 | 0 | 0 | 0 | 5 |
 | lists | 54 | 3 | 0 | 0 | 57 |
 | materialize | 8 | 0 | 0 | 0 | 8 |
 | negation | 8 | 0 | 19 | 0 | 27 |
@@ -18,8 +19,7 @@ This report summarizes the file-based conformance corpus under `test/conformance
 | rules | 12 | 3 | 0 | 0 | 15 |
 | strings | 40 | 0 | 0 | 0 | 40 |
 | syntax | 11 | 28 | 0 | 0 | 39 |
-| table | 6 | 0 | 0 | 0 | 6 |
 | terms | 29 | 3 | 0 | 0 | 32 |
 | unification | 16 | 0 | 0 | 0 | 16 |
 | variables | 16 | 11 | 0 | 0 | 27 |
-| **Total** | **321** | **56** | **19** | **21** | **417** |
+| **Total** | **320** | **56** | **19** | **21** | **416** |

package/docs/guide.md

@@ -4,8 +4,13 @@ This guide introduces Eyelang, a small Horn-clause language and engine whose sou
 
 Programs write relations directly, for example `ancestor(pat, emma)` or `status(case1, accepted)`. Web identifiers can be written as ordinary quoted atoms that include angle brackets, for example `'<https://schema.org/name>'`, when a program needs explicit IRI-shaped names without prefix declarations. Eyelang output is ordinary Eyelang syntax: by default, the CLI materializes selected answer facts and prints those facts only. Pass `--proof` (or `-p`) when you also want each answer followed by a `why/2` explanation fact that records the proof. Programs may add `materialize/2` declarations such as `materialize(answer, 2).` to focus output on selected predicates.
 
+Execution is automatically hybrid. Ordinary predicates use indexed
+goal-directed resolution, while dependency analysis detects recursive groups
+and tables their bound calls. Programs describe relations without choosing the
+engine's search strategy.
 
-For the normative language definition, including lexical syntax, terms, clauses, goals, built-ins, `table/2`, `materialize/2`, and conformance boundaries, read the [Eyelang language reference](language-reference.md).
+
+For the normative language definition, including lexical syntax, terms, clauses, goals, built-ins, automatic hybrid reasoning, `materialize/2`, and conformance boundaries, read the [Eyelang language reference](language-reference.md).
 
 ## Contents
 
@@ -197,7 +202,7 @@ The default output is then:
 answer(case1, accepted).
 ```
 
-`materialize/2` is a declaration, not a logical rule to prove. It affects which predicates the CLI prints, not the meaning of the rules themselves. Materialized output facts are not inserted back into the running program for later goals; if later output predicates reuse the same derived helper relation, eyelang proves it again unless that helper is declared with `table/2`. Source facts are indexed and reused normally, and tabled solved goals are reused inside the same solver run.
+`materialize/2` is a declaration, not a logical rule to prove. It affects which predicates the CLI prints, not the meaning of the rules themselves. Materialized output facts are not inserted back into the running program for later goals. Source facts are indexed and reused normally, and answers for automatically tabled recursive predicates are reused inside the same solver run.
 
 ## Writing programs
 
@@ -334,9 +339,9 @@ Use `holds/2` when you want to match the member term directly, for example `name
 | [`cache-performance.pl`](../examples/cache-performance.pl) | Summarizes cache latency performance. | [`output/cache-performance.pl`](../examples/output/cache-performance.pl) |
 | [`canary-release.pl`](../examples/canary-release.pl) | Decides canary rollout or rollback. | [`output/canary-release.pl`](../examples/output/canary-release.pl) |
 | [`cat-koko.pl`](../examples/cat-koko.pl) | Demonstrates named existential witnesses from a Cat Koko rule pattern. | [`output/cat-koko.pl`](../examples/output/cat-koko.pl) |
-| [`catalan-convolution.pl`](../examples/catalan-convolution.pl) | Computes Catalan numbers by tabled convolution. | [`output/catalan-convolution.pl`](../examples/output/catalan-convolution.pl) |
+| [`catalan-convolution.pl`](../examples/catalan-convolution.pl) | Computes Catalan numbers by automatically tabled convolution. | [`output/catalan-convolution.pl`](../examples/output/catalan-convolution.pl) |
 | [`cdcl-sat-solver.pl`](../examples/cdcl-sat-solver.pl) | Simulates one CDCL conflict-analysis step with a learned clause and backjumped model. | [`output/cdcl-sat-solver.pl`](../examples/output/cdcl-sat-solver.pl) |
-| [`chart-parser.pl`](../examples/chart-parser.pl) | Parses small sentences with a tabled chart parser. | [`output/chart-parser.pl`](../examples/output/chart-parser.pl) |
+| [`chart-parser.pl`](../examples/chart-parser.pl) | Parses small sentences with an automatically tabled chart parser. | [`output/chart-parser.pl`](../examples/output/chart-parser.pl) |
 | [`clinical-trial-screening.pl`](../examples/clinical-trial-screening.pl) | Screens candidates for a trial. | [`output/clinical-trial-screening.pl`](../examples/output/clinical-trial-screening.pl) |
 | [`collatz-1000.pl`](../examples/collatz-1000.pl) | Materializes Collatz trajectories for starts 1000 down to 1. | [`output/collatz-1000.pl`](../examples/output/collatz-1000.pl) |
 | [`combinatorics-findall-sort.pl`](../examples/combinatorics-findall-sort.pl) | Collects and sorts finite combinations. | [`output/combinatorics-findall-sort.pl`](../examples/output/combinatorics-findall-sort.pl) |
@@ -405,7 +410,7 @@ Use `holds/2` when you want to match the member term directly, for example `name
 | [`heron-theorem.pl`](../examples/heron-theorem.pl) | Computes triangle area by Heron's theorem. | [`output/heron-theorem.pl`](../examples/output/heron-theorem.pl) |
 | [`ideal-gas-law.pl`](../examples/ideal-gas-law.pl) | Applies the ideal gas law. | [`output/ideal-gas-law.pl`](../examples/output/ideal-gas-law.pl) |
 | [`illegitimate-reasoning.pl`](../examples/illegitimate-reasoning.pl) | Detects suspect reasoning patterns. | [`output/illegitimate-reasoning.pl`](../examples/output/illegitimate-reasoning.pl) |
-| [`integer-partitions.pl`](../examples/integer-partitions.pl) | Counts integer partitions with tabled dynamic programming. | [`output/integer-partitions.pl`](../examples/output/integer-partitions.pl) |
+| [`integer-partitions.pl`](../examples/integer-partitions.pl) | Counts integer partitions with automatic tabling. | [`output/integer-partitions.pl`](../examples/output/integer-partitions.pl) |
 | [`intuitionistic-logic-kripke.pl`](../examples/intuitionistic-logic-kripke.pl) | Emulates intuitionistic Kripke forcing and constructive implication. | [`output/intuitionistic-logic-kripke.pl`](../examples/output/intuitionistic-logic-kripke.pl) |
 | [`job-shop-scheduling.pl`](../examples/job-shop-scheduling.pl) | Searches a small job-shop schedule and minimizes makespan. | [`output/job-shop-scheduling.pl`](../examples/output/job-shop-scheduling.pl) |
 | [`knapsack-optimization.pl`](../examples/knapsack-optimization.pl) | Optimizes a finite 0/1 knapsack pack with aggregation. | [`output/knapsack-optimization.pl`](../examples/output/knapsack-optimization.pl) |
@@ -478,7 +483,7 @@ Use `holds/2` when you want to match the member term directly, for example `name
 | [`vector-similarity.pl`](../examples/vector-similarity.pl) | Computes dot product, norm, and cosine similarity. | [`output/vector-similarity.pl`](../examples/output/vector-similarity.pl) |
 | [`vulnerability-impact.pl`](../examples/vulnerability-impact.pl) | Analyzes vulnerable transitive dependencies and urgent patch impact. | [`output/vulnerability-impact.pl`](../examples/output/vulnerability-impact.pl) |
 | [`web-names.pl`](../examples/web-names.pl) | Uses quoted IRI-shaped atoms as first-class web names and joins them across a tiny graph. | [`output/web-names.pl`](../examples/output/web-names.pl) |
-| [`weighted-interval-scheduling.pl`](../examples/weighted-interval-scheduling.pl) | Selects the best non-overlapping weighted intervals with tabled dynamic programming. | [`output/weighted-interval-scheduling.pl`](../examples/output/weighted-interval-scheduling.pl) |
+| [`weighted-interval-scheduling.pl`](../examples/weighted-interval-scheduling.pl) | Selects the best non-overlapping weighted intervals with automatic tabling. | [`output/weighted-interval-scheduling.pl`](../examples/output/weighted-interval-scheduling.pl) |
 | [`witch.pl`](../examples/witch.pl) | Derives the classic “burn the witch” rule chain. | [`output/witch.pl`](../examples/output/witch.pl) |
 | [`wolf-goat-cabbage.pl`](../examples/wolf-goat-cabbage.pl) | Solves the wolf-goat-cabbage river crossing. | [`output/wolf-goat-cabbage.pl`](../examples/output/wolf-goat-cabbage.pl) |
 | [`workplace-compliance.pl`](../examples/workplace-compliance.pl) | Classifies workplace compliance from explicit action facts. | [`output/workplace-compliance.pl`](../examples/output/workplace-compliance.pl) |
@@ -599,11 +604,7 @@ path(a, Y).
 status(Case, accepted).
 ```
 
-Ground facts use a fast path that avoids freshening and copying a rule body. Recursive-predicate detection uses an explicit work stack, which keeps large predicate chains safer in the browser. Recursive examples use an active-call variant guard to prevent common cyclic closures from looping. Selected predicates can be tabled with:
-
-```eyelang
-table(path, 2).
-```
+Ground facts use a fast path that avoids freshening and copying a rule body. Recursive-predicate detection uses an explicit work stack, which keeps large predicate chains safer in the browser. eyelang automatically tables recursive helper groups, including dependencies reached through supported meta-goals. Directly materialized recursive relations and other goals use ordinary depth-first resolution; this preserves cyclic open-relation traversal. Fully open calls retain the ordinary path rather than materializing an entire relation. Authors do not need a search-control declaration.
 
 Predicates can also carry advisory mode and determinism declarations for documentation and host tooling:
 

package/docs/language-reference.md

@@ -46,7 +46,7 @@
   - [9.10 Search control](#910-search-control)
 - [10. Implementation-specific built-ins](#10-implementation-specific-built-ins)
 - [11. Declarations](#11-declarations)
-  - [11.1 Tabling](#111-tabling)
+  - [11.1 Automatic hybrid reasoning](#111-automatic-hybrid-reasoning)
   - [11.2 Default-output materialization](#112-default-output-materialization)
 - [12. eyelang Sockets](#12-eyelang-sockets)
   - [12.1 Socket vocabulary](#121-socket-vocabulary)
@@ -634,19 +634,21 @@ An implementation that provides explanation output SHOULD make implementation-sp
 
 Declarations are written as ordinary facts, but the host treats them specially.
 
-### 11.1 Tabling
+### 11.1 Automatic hybrid reasoning
 
-```eyelang
-table(path, 2).
-```
+eyelang automatically combines ordinary goal-directed resolution with tabled
+resolution. Predicate dependency cycles are detected when a program is loaded,
+including dependencies inside conjunctions, negation, `once/1`, `forall/2`, and
+aggregation goals. Recursive helper predicate groups are tabled automatically;
+directly materialized recursive relations and other groups use ordinary
+depth-first resolution and indexed fact lookup. This conservative boundary
+avoids prematurely completing bound subcalls when an open output relation walks
+cyclic data. Authors do not select an execution strategy in source code.
 
-The first argument MUST be an atom constant and the second argument MUST be a non-negative integer. A `table/2` declaration asks the solver to table answers for the named predicate group when applicable. The old `memoize/2` spelling is not part of the eyelang language.
-
-Example:
-
-```eyelang
-table(path, 2).
-```
+For a tabled call with at least one bound argument, answers may be cached and
+reused within a solver run. Fully open calls continue with ordinary resolution
+so that tabling does not force the whole relation to be materialized. This is a
+search-control strategy and does not change the logical meaning of a program.
 
 ### 11.2 Default-output materialization
 
@@ -663,7 +665,7 @@ materialize(status, 2).
 materialize(reason, 2).
 ```
 
-`materialize/2` affects host output selection only; it does not change the logical meaning of the program. Materialized output facts are not asserted as new source facts for subsequent output goals. A host MAY solve several materialized predicates in one solver run, and tabled predicate answers MAY be reused within that run, but this reuse is controlled by `table/2`, not by materialization.
+`materialize/2` affects host output selection only; it does not change the logical meaning of the program. Materialized output facts are not asserted as new source facts for subsequent output goals. A host MAY solve several materialized predicates in one solver run, and automatically tabled predicate answers MAY be reused within that run.
 
 ### 11.3 Advisory modes and determinism
 
@@ -788,7 +790,7 @@ A conforming eyelang implementation supports the standard language described abo
 - lists and comma conjunctions;
 - answer printing and read-back formatting;
 - the standard built-ins listed in section 9;
-- `table/2` declarations;
+- automatic hybrid goal-directed and tabled execution;
 - `materialize/2` declarations;
 - advisory `mode/3`, `det/2`, and `semidet/2` declarations;
 - default derived output;

package/examples/abstract-interpretation.pl

@@ -15,7 +15,6 @@ materialize(absState, 3).
 materialize(absWarning, 2).
 materialize(absConclusion, 2).
 
-table(abs_state, 3).
 
 % The abstract domain.
 input_sign(neg).

package/examples/bayes-therapy.pl

@@ -4,7 +4,7 @@
 %
 % Read this as two stacked inference problems: first infer disease posterior
 % probabilities from symptoms, then score each therapy by averaging outcomes
-% over that posterior distribution. The tabled predicates are exactly the
+% over that posterior distribution. The recursive predicates are
 % shared layers used by several materialized reports.
 materialize(diseases, 2).
 materialize(therapies, 2).
@@ -19,9 +19,6 @@ materialize(utility, 2).
 materialize(recommendedTherapy, 2).
 
 % Program structure: facts set up the scenario, and rules derive the materialized conclusions.
-table(scores_for, 2).
-table(likelihood, 3).
-table(expected_success, 2).
 
 % Bayes therapy decision support adapted from Eyeling bayes-therapy.n3.
 % Probabilities are illustrative and are not medical advice.

package/examples/binomial-vandermonde.pl

@@ -5,10 +5,9 @@
 % 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 tabled because row sums and identities reuse prefixes.
+% and is cached automatically because row sums and identities reuse prefixes.
 materialize(binomial_answer, 2).
 
-table(choose_step, 5).
 
 choose(N, K, C) :-
   ge(K, 0),

package/examples/catalan-convolution.pl

@@ -1,11 +1,10 @@
-% Catalan numbers by tabled convolution.
+% Catalan numbers by automatically 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
 % triangulations, shown here with small wrapper predicates.
 materialize(catalan_answer, 2).
 
-table(catalan, 2).
 
 % C_0 = 1; higher values are computed by the convolution sum.
 catalan(0, 1).

package/examples/chart-parser.pl

@@ -1,11 +1,10 @@
-% A tiny tabled chart parser for a context-free grammar.
+% A tiny automatically 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
 % grammar recognition into chart parsing, so ambiguous phrases share subparses.
 materialize(chart_parser_answer, 2).
 
-table(span, 4).
 
 % Two sample sentences share the same tiny grammar but have different parse counts.
 

package/examples/collatz-1000.pl

@@ -6,10 +6,9 @@
 % https://raw.githubusercontent.com/eyereasoner/eyeling/refs/heads/main/examples/collatz-1000.n3
 
 % Output declarations: materialize/2 selects the relations written to this example's golden output.
-% table/2 caches shared suffix trajectories so the 1000 starts do not recompute
+% Automatic tabling caches shared suffix trajectories so the 1000 starts do not recompute
 % the same Collatz tails hundreds of times.
 materialize(collatzTrajectory, 2).
-table(collatz, 2).
 
 % Program structure: facts set up the scenario, and rules derive the materialized conclusions.
 % The N3 source defines repeat/2 recursively; this Eyelang version uses the

package/examples/continued-fraction-sqrt2.pl

@@ -1,4 +1,4 @@
-% Convergents of sqrt(2) by tabled recurrence.
+% Convergents of sqrt(2) by automatically 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
@@ -6,7 +6,6 @@
 % pell_error/2 connects the approximation sequence with P^2 - 2Q^2 = +/-1.
 materialize(convergent_answer, 2).
 
-table(conv, 3).
 
 % Base convergents are 1/1 and 3/2.
 conv(0, 1, 1).

package/examples/critical-path-schedule.pl

@@ -6,8 +6,6 @@
 % queries share the same project-network subproblems.
 materialize(critical_path_answer, 2).
 
-table(earliest_start, 2).
-table(finish_time, 2).
 
 % Durations are in arbitrary project time units.
 task(requirements, 2).

package/examples/dijkstra-risk-path.pl

@@ -15,7 +15,6 @@ 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, (

package/examples/drone-corridor-planner.pl

@@ -5,7 +5,6 @@
 
 materialize(gps_plan, 2).
 
-table(path, 9).
 
 fuel(fuel7, [t, t, t, t, t, t, t]).
 

package/examples/equality-saturation.pl

@@ -11,8 +11,6 @@
 
 materialize(egraphAnswer, 2).
 
-table(equivalent_at_depth, 3).
-table(expr_cost, 2).
 
 % Start expression:
 %   ((x + 0) * 1) + 2 * (1 + 2)

package/examples/family-cousins.pl

@@ -7,9 +7,6 @@ materialize(cousin, 2).
 
 % The family tree is scoped inside family_graph/2.  family_statement/3 projects
 % only the parent and seedBranch facts that the cousin rules need.
-table(family_statement, 3).
-table(generation, 2).
-table(branch, 2).
 
 % Family-cousins derivation adapted from Eyeling family-cousins.n3.
 % Generation numbers are derived from parent links; branch labels distinguish

package/examples/fibonacci.pl

@@ -10,7 +10,6 @@ materialize(fibonacci, 2).
 
 % fib_case/1 bounds the public queries, while fib_pair/3 implements the
 % fast-doubling recurrence F(2n), F(2n+1) over arbitrary-size integers.
-table(fib_pair, 3).
 
 % BigInt Fibonacci via fast doubling, implemented in Prolog using generic
 % decimal add/sub/mul built-ins.  The result predicate follows Eyeling's

package/examples/gd-step-certified.pl

@@ -16,13 +16,6 @@ materialize(objectiveBounds, 2).
 materialize(widthContractsAt, 2).
 
 % Program structure: facts set up the scenario, and rules derive the materialized conclusions.
-table(x_bounds, 3).
-table(width, 2).
-table(g_bounds, 3).
-table(p_bounds, 3).
-table(midpoint, 3).
-table(f_lower, 2).
-table(f_upper, 2).
 
 % Adapted from Eyeling's gd-step-certified.n3.
 % One-dimensional gradient descent over certified interval bounds.

package/examples/gps.pl

@@ -15,8 +15,6 @@ materialize(comfort, 2).
 materialize(selectedRoute, 2).
 materialize(comparison, 2).
 
-table(path, 7).
-table(traveller_path, 6).
 
 case_graph(caseGraph, (
   location(i1, gent),

package/examples/hamiltonian-path.pl

@@ -10,7 +10,6 @@ materialize(hamiltonianPath, 2).
 
 % The finite six-vertex graph is small enough to search directly.  adjacent/2
 % is tabled because every candidate path repeatedly asks the same edge tests.
-table(adjacent, 2).
 
 edge(v1, v2).
 edge(v1, v3).

package/examples/hanoi.pl

@@ -5,7 +5,6 @@
 
 materialize(answer, 2).
 
-table(hanoi, 5).
 
 hanoi(0, _from, _to, _via, []).
 hanoi(N, From, To, Via, Moves) :-

package/examples/integer-partitions.pl

@@ -5,7 +5,6 @@
 % memoization the same (N,K) subproblems are reached many times.
 materialize(partition_answer, 2).
 
-table(partitions, 3).
 
 % One empty sum partitions zero; positive N with K=0 is impossible.
 partitions(0, _k, 1).

package/examples/intuitionistic-logic-kripke.pl

@@ -8,8 +8,6 @@
 materialize(intuitionistic_truth, 3).
 materialize(intuitionistic_countermodel, 3).
 
-table(leq, 2).
-table(forces, 2).
 
 world(root).
 world(left).

package/examples/knuth-bendix-completion.pl

@@ -8,7 +8,6 @@
 
 materialize(kbAnswer, 2).
 
-table(normal_form, 2).
 
 % Oriented equations for a monoid-like append constructor.
 %   append(nil, x)       -> x

package/examples/language.pl

@@ -3,7 +3,7 @@
 % This file intentionally uses the modern Eyelang surface syntax:
 %   - `.pl` source files instead of Prolog `.pl` files
 %   - ISO Prolog-style uppercase variables
-%   - `table/2` for tabled recursive predicates
+%   - automatic tabling for recursive predicates
 %   - advisory `mode/3` and `semidet/2` declarations
 %   - quoted angle-bracket atoms for web-shaped identifiers
 %
@@ -12,7 +12,6 @@
 
 materialize(path, 2).
 
-table(path, 2).
 mode(edge, 2, [in, out]).
 mode(path, 2, [in, out]).
 semidet(edge, 2).

package/examples/matrix-chain-order.pl

@@ -1,11 +1,10 @@
-% Matrix-chain multiplication order by tabled interval dynamic programming.
+% Matrix-chain multiplication order by automatically 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
 % reconstructs one optimal multiplication tree.
 materialize(matrix_chain_answer, 2).
 
-table(cost, 3).
 
 % Matrix dimensions are stored as adjacent p-values: matrix I has dimensions P_{I-1} x P_I.
 

package/examples/modular-exponentiation.pl

@@ -5,7 +5,6 @@
 % are reused by Fermat-style congruence checks.
 materialize(modular_answer, 2).
 
-table(pow_mod, 4).
 
 % Base case: any nonzero base to exponent zero is 1 modulo Mod.
 pow_mod(_base, 0, Mod, Result) :- mod(1, Mod, Result).

package/examples/monkey-bananas.pl

@@ -10,7 +10,6 @@ materialize(plan, 2).
 materialize(solved, 2).
 
 % Program structure: facts set up the scenario, and rules derive the materialized conclusions.
-table(reachable, 3).
 
 % Derivation rules: each rule below contributes one logical step toward the displayed results.
 plan(Moves) :-

package/examples/n-queens-8.pl

@@ -8,7 +8,6 @@ materialize(n_queens_answer, 2).
 % Cache diagonal checks; the same row/distance/suffix states recur across many
 % candidate permutations during the 8-queens search.  The example asks only for
 % the first solution with once/1, keeping it playground-friendly.
-table(no_diagonal_attack, 3).
 
 perm([], []).
 perm(Items, [X|Rest]) :-

package/examples/partial-evaluator.pl

@@ -8,7 +8,6 @@
 
 materialize(partialEvalAnswer, 2).
 
-table(pe, 3).
 
 % Expression language: const/1, bool/1, var/1, add/2, mul/2, and if/3.
 % Static environments are lists of bind(Name, ResidualValue) terms.

package/examples/peano-calculus.pl

@@ -6,9 +6,6 @@
 % a few finite calculations as readable examples.
 
 materialize(peano_answer, 2).
-table(padd, 3).
-table(pmul, 3).
-table(pfact, 2).
 
 % Addition.
 padd(A, z, A).

package/examples/pell-equation.pl

@@ -1,11 +1,10 @@
-% Pell equation x^2 - 2y^2 = 1 by tabled recurrence.
+% Pell equation x^2 - 2y^2 = 1 by automatically tabled recurrence.
 %
 % The fundamental solution (3,2) induces a linear recurrence for all positive
 % solutions of x^2 - 2y^2 = 1.  The example materializes later solutions and also
 % rechecks the Diophantine identity so the generated sequence is auditable.
 materialize(pell_answer, 2).
 
-table(pell, 3).
 
 % N=0 is the neutral solution; each recursive step multiplies by 3 + 2*sqrt(2).
 pell(0, 1, 0).

package/examples/pointer-analysis.pl

@@ -10,8 +10,6 @@ materialize(heapField, 2).
 materialize(pointerFlow, 2).
 materialize(pointerConclusion, 2).
 
-table(points_to, 2).
-table(field_points_to, 2).
 
 % Source-program statements:
 %   x = &object_a

package/examples/prime-range.pl

@@ -6,7 +6,6 @@
 % composite, and `totient/2` counts numbers coprime with the input.
 
 materialize(prime_result, 2).
-table(gcd, 3).
 
 candidate(N) :-
   between(2, 30, N).