Implementation of Tabled Evaluation with Delaying in Prolog

@article{Ramesh1997ImplementationOT,
  title={Implementation of Tabled Evaluation with Delaying in Prolog},
  author={R. Ramesh and W. Chen},
  journal={IEEE Trans. Knowl. Data Eng.},
  year={1997},
  volume={9},
  pages={559-574}
}
  • R. Ramesh, W. Chen
  • Published 1997
  • Computer Science
  • IEEE Trans. Knowl. Data Eng.
  • Unlike SLD resolution as implemented in Prolog, tabled evaluation with delaying guarantees termination for function free logic programs, avoids repeated computation of identical subqueries, and handles recursion through negation. It is often used in query processing and nonmonotonic reasoning where termination is required. The paper presents a new technique for incorporating tabled evaluation into existing Prolog systems. It requires neither time consuming modifications of a Prolog engine nor… CONTINUE READING
    15 Citations

    Figures, Tables, and Topics from this paper

    Towards a Complete Scheme for Tabled Execution Based on Program Transformation
    • 9
    • Highly Influenced
    • PDF
    On Applying Linear Tabling to Logic Programs
    • M. Jo
    • Computer Science
    • 2010
    • PDF
    An abstract machine for tabled execution of fixed-order stratified logic programs
    • 143
    • PDF
    A Program Transformation for Continuation Call-Based Tabled Execution
    • 3
    • Highly Influenced
    • PDF
    On Applying Program Transformation to Implement Suspension-Based Tabling in Prolog
    • 7
    • PDF
    An Efficient Implementation of Linear Tabling Based on Dynamic Reordering of Alternatives
    • CRACS, LA INESC-Porto
    • 2009
    • 4
    • PDF
    An Efficient Implementation of Linear Tabling Based on Dynamic Reordering of Alternatives
    • 1
    • PDF
    On Applying Or-Parallelism and Tabling to Logic Programs
    • 56
    • PDF
    Memoisation: Purely, Left-recursively, and with (Continuation Passing) Style
    • 2
    • PDF

    References

    SHOWING 1-10 OF 23 REFERENCES
    Query evaluation under the well-founded semantics
    • 127
    XSB as an efficient deductive database engine
    • 400
    Controlling the Search in Bottom-Up Evaluation
    • 59
    Tabled Evaluation with Delaying for General Logic Programs
    • 365
    • Highly Influential
    Rule Ordering in Bottom-Up Fixpoint Evaluation of Logic Programs
    • 56
    • PDF
    Efficient Top-Down Computation of Queries under the Well-Founded Semantics
    • 145
    • PDF
    Extension table built‐ins for prolog
    • 20
    • Highly Influential
    Recursive query processing: the power of logic
    • 127
    Extending Prolog with Nonmonotonic Reasoning
    • 9
    • Highly Influential
    Query Restricted Bottom-Up Evaluation of Normal Logic Programs
    • 23