An improved continuation call-based implementation of tabling

Authors:
Pablo Chico de Guzmán;Manuel Carro;Manuel V. Hermenegildo;Cláudio Silva;Ricardo Rocha
Affiliations:
School of Computer Science, Univ. Politécnica de Madrid, Spain and Depts. of Comp. Science and Electr. and Comp. Eng., Univ. of New Mexico;School of Computer Science, Univ. Politécnica de Madrid, Spain;School of Computer Science, Univ. Politécnica de Madrid, Spain and Depts. of Comp. Science and Electr. and Comp. Eng., Univ. of New Mexico;DCC-FC & LIACC, University of Porto, Portugal;DCC-FC & LIACC, University of Porto, Portugal
Venue:
PADL'08 Proceedings of the 10th international conference on Practical aspects of declarative languages
Year:
2008

Citing 14
Cited 5

Memoing for logic programs

Communications of the ACM
A portable method for integrating SLG resolution into prolog systems

ILPS '94 Proceedings of the 1994 International Symposium on Logic programming
Tabled evaluation with delaying for general logic programs

Journal of the ACM (JACM)
Practical program analysis using general purpose logic programming systems—a case study

PLDI '96 Proceedings of the ACM SIGPLAN 1996 conference on Programming language design and implementation
An abstract machine for tabled execution of fixed-order stratified logic programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
OLD Resolution with Tabulation

Proceedings of the Third International Conference on Logic Programming
A Simple Scheme for Implementing Tabled Logic Programming Systems Based on Dynamic Reordering of Alternatives

Proceedings of the 17th International Conference on Logic Programming
CAT: The Copying Approach to Tabling

PLILP '98/ALP '98 Proceedings of the 10th International Symposium on Principles of Declarative Programming
Efficient Model Checking Using Tabled Resolution

CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
High-level languages for small devices: a case study

CASES '06 Proceedings of the 2006 international conference on Compilers, architecture and synthesis for embedded systems
Linear tabling strategies and optimizations

Theory and Practice of Logic Programming
On applying program transformation to implement suspension-based tabling in prolog

ICLP'07 Proceedings of the 23rd international conference on Logic programming
Tabling in mercury: design and implementation

PADL'06 Proceedings of the 8th international conference on Practical Aspects of Declarative Languages
F-OWL: an inference engine for semantic web

FAABS'04 Proceedings of the Third international conference on Formal Approaches to Agent-Based Systems

An Overview of the Ciao Multiparadigm Language and Program Development Environment and Its Design Philosophy

Concurrency, Graphs and Models
A Sketch of a Complete Scheme for Tabled Execution Based on Program Transformation

ICLP '08 Proceedings of the 24th International Conference on Logic Programming
High Level Thread-Based Competitive Or-Parallelism in Logtalk

PADL '09 Proceedings of the 11th International Symposium on Practical Aspects of Declarative Languages
Towards a Complete Scheme for Tabled Execution Based on Program Transformation

PADL '09 Proceedings of the 11th International Symposium on Practical Aspects of Declarative Languages
The yap prolog system

Theory and Practice of Logic Programming - Prolog Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Tabled evaluation has been proved an effective method to improve several aspects of goal-oriented query evaluation, including termination and complexity. Several "native" implementations of tabled evaluation have been developed which offer good performance, but many of them require significant changes to the underlying Prolog implementation, including the compiler and the abstract machine. Approaches based on program transformation, which tend to minimize changes to both the Prolog compiler and the abstract machine, have also been proposed, but they often result in lower efficiency. We explore some techniques aimed at combining the best of these worlds, i.e., developing an extensible implementation which requires minimal modifications to the compiler and the abstract machine, and with reasonably good performance. Our preliminary experiments indicate promising results.