Memoing for logic programs

Warren, David S.

doi:10.1145/131295.131299

Cited by 161 publications

(70 citation statements)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Tabling adds the intuition of short-circuiting redundant computations (Warren 1992). This paper shows how to introduce into tabled logic program evaluation a bottom-up component, whose procedural intuition is the initialization of a data structure, in which a relation is initially computed and filled, on first demand, and then used throughout the remainder of a larger computation for efficient lookup.…”

Section: Introductionmentioning

confidence: 99%

Top-down and Bottom-up Evaluation Procedurally Integrated

Warren

2018

EasyChair Preprints

View full text Add to dashboard Cite

This paper describes how the Logic Programming System XSB combines top-down and bottomup computation through the mechanisms of variant tabling and subsumptive tabling with abstraction, respectively.It is well known that top-down evaluation of logical rules in Prolog has a procedural interpretation as recursive procedure invocation (Kowalski 1986). Tabling adds the intuition of short-circuiting redundant computations (Warren 1992). This paper shows how to introduce into tabled logic program evaluation a bottom-up component, whose procedural intuition is the initialization of a data structure, in which a relation is initially computed and filled, on first demand, and then used throughout the remainder of a larger computation for efficient lookup. This allows many Prolog programs to be expressed fully declaratively, programs which formerly required procedural features, such as assert, to be made efficient.

show abstract

Section: Introductionmentioning

confidence: 99%

Top-down and Bottom-up Evaluation Procedurally Integrated

Warren

2018

EasyChair Preprints

View full text Add to dashboard Cite

show abstract

“…Tabling [1][2][3] is a strategy for executing logic programs which memoizes already processed calls and their answers to improve several of the limitations of the SLD resolution strategy. It guarantees termination for programs with the bounded term size property, improves efficiency in programs which repeatedly perform some computation, and has been successfully applied to deductive databases [4], program analysis [5,6], semantic Web reasoning [7], model checking [8], etc.…”

Section: Introductionmentioning

confidence: 99%

A Tabling Implementation Based on Variables with Multiple Bindings

2009

View full text Add to dashboard Cite

Abstract. Suspension-based tabling systems have to save and restore computation states belonging to OR branches. Stack freezing combined with (forward) trailing is among the better-known implementation approaches for this purpose. Resuming a goal using this technique reinstalls the bindings for all the variables in the environment where the goal was suspended. In this paper we explore an alternative approach where variables can keep track of several bindings, associated with suspensions. Resuming a goal boils down to determining which suspension has to be resumed, in order to select, when dereferencing, the bindings which were active at the moment of suspending. We present the ideas behind this approach, highlight several advantages over other suspension-based implementations, and perform an experimental evaluation. We also recall the similarity between OR-parallelism and suspension-based implementations of tabling, and discuss similarities with the Version Vectors Method, among others.

show abstract

“…Tabling [1][2][3] is a strategy for executing logic programs which remembers already processed calls and their answers to overcome several limitations of SLD resolution: non-termination due to repeated subgoals can sometimes be avoided (tabling ensures termination of bounded term-size programs) and some cases of recomputation can also be automatically optimized. The first occurrence (the generator ) of a call to a predicate marked as tabled and subsequent calls which are identical up to variable renaming (the consumers) are recognized.…”

Section: Introductionmentioning

confidence: 99%

A Sketch of a Complete Scheme for Tabled Execution Based on Program Transformation

2008

View full text Add to dashboard Cite

Abstract. Tabled evaluation has proved to be an effective method to improve several aspects of goal-oriented query evaluation, including termination and complexity. "Native" implementations of tabled evaluation offer good performance, but also require significant implementation effort, affecting compiler and abstract machine. Alternatively, program transformation-based implementations, such as the original continuation call (CCall) technique, offer lower implementation burden at some efficiency cost. A limitation of the original CCall proposal is that it limits the interleaving of tabled and non-tabled predicates and thus cannot be used for arbitrary programs. In this work we present an extension of the CCall technique that allows the execution of arbitrary tabled programs, as well as some performance results. Our approach offers a useful tradeoff that can be competitive with state-of-the-art implementations, while keeping implementation effort relatively low.

show abstract

Memoing for logic programs

Cited by 161 publications

References 33 publications

Top-down and Bottom-up Evaluation Procedurally Integrated

Top-down and Bottom-up Evaluation Procedurally Integrated

A Tabling Implementation Based on Variables with Multiple Bindings

A Sketch of a Complete Scheme for Tabled Execution Based on Program Transformation

Contact Info

Product

Resources

About