Using Prolog Tabling to Turn Exponential Recursion into Linear Time
Learn how Prolog tabling (SLG resolution) memoizes subgoals to turn exponential recursive programs like Fibonacci into linear‑time solutions.
Loading…
ReadMeFeed / Community knowledge
#tabling
Real questions. Useful conversations. Find the people who know your stack.
prologTabling in Prolog: When Memoizing a Recursive Predicate Is Worth It
Tabling memoizes recursive Prolog subgoals so cyclic queries terminate. A decision guide to engine support, directive syntax, and the cut and side-effect trade-offs.
Missing solutions when cut appears inside a tabled predicate
Goal: determine whether the cut operator (!/0) should affect already‑tabled answers when evaluating a tabled predicate that contains a cut in one of its clauses. Uncertainty: XSB treats the cut as a local commitment that does not invalidate existing table entries, whereas Yap and SWI‑Prolog (with library(tabling)) may propagate the cut to prune the table, le