Just enough tabling

We introduce just enough tabling (JET), a mechanism to suspend and resume the tabled execution of logic programs at an arbitrary point. In particular, JET allows pruning of tabled logic programs to be performed without resorting to any recomputation. We discuss issues that are involved in supporting pruning in tabled resolution, how re-execution of tabled computations which were previously pruned can be avoided, and we describe the implementasuch a scheme based on an abstract machine like CHAT, which implements the suspension/resumption support that tabling requires through a combination of freezing and copying of execution states of suspended computations. Properties of just enough tabling and possible uses of the JET mechanism in a tabling system are also briefly discussed. Categories and Subject Descriptors D.3.3 [Programming Languages]: Language Constructs and Features; D.3.2 [Programming Languages]: Language Classifications—Constraint and logic languages General Terms Languag...

• Type: Conference
• Year: 2004
• Where: PPDP
• Authors: Konstantinos F. Sagonas, Peter J. Stuckey
• Keywords: Logic Programs, PPDP 2004, Tabled Logic Programs, Tabling