A general implementation framework for tabled CLP

Authors:
Pablo Chico de Guzmán;Manuel Carro;Manuel V. Hermenegildo;Peter Stuckey
Affiliations:
IMDEA Software Institute, Spain;IMDEA Software Institute, Spain,School of Computer Science, Univ. Politécnica de Madrid, Spain;IMDEA Software Institute, Spain,School of Computer Science, Univ. Politécnica de Madrid, Spain;NICTA Victoria Research Laboratory, Australia,Department of Computing and Information Systems, University of Melbourne, Australia
Venue:
FLOPS'12 Proceedings of the 11th international conference on Functional and Logic Programming
Year:
2012

Citing 20
Cited 0

Memoing for logic programs

Communications of the ACM
A theory of timed automata

Theoretical Computer Science
Constraint query languages

Selected papers of the 9th annual ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
An abstract machine for tabled execution of fixed-order stratified logic programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
Comparing trailing and copying for constraint programming

Proceedings of the 1999 international conference on Logic programming
CHAT: the copy-hybrid approach to tabling

Future Generation Computer Systems
Incremental analysis of constraint logic programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
Memoing Evaluation for Constraint Extensions of Datalog

Constraints
OLD Resolution with Tabulation

Proceedings of the Third International Conference on Logic Programming
Efficient Real-Time Model Checking Using Tabled Logic Programming and Constraints

ICLP '02 Proceedings of the 18th International Conference on Logic Programming
Metastructures versus Attributed Variables in the Context of Extensible Unification

PLILP '92 Proceedings of the 4th International Symposium on Programming Language Implementation and Logic Programming
A System for Tabled Constraint Logic Programming

CL '00 Proceedings of the First International Conference on Computational Logic
Constraint Databases and Program Analysis Using Abstract Interpretation

CDB '97 Second International Workshop on Constraint Database Systems, Constraint Databases and Their Applications
Fully Dynamic Shortest Paths and Negative Cycles Detection on Digraphs with Arbitrary Arc Weights

ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
The octagon abstract domain

Higher-Order and Symbolic Computation
Tchr: A framework for tabled clp

Theory and Practice of Logic Programming
Swapping evaluation: A memory-scalable solution for answer-on-demand tabling*

Theory and Practice of Logic Programming
Retroactive subsumption-based tabled evaluation of logic programs

JELIA'10 Proceedings of the 12th European conference on Logics in artificial intelligence
Tabled resolution + constraints: a recipe for model checking real-time systems

RTSS'10 Proceedings of the 21st IEEE conference on Real-time systems symposium
An overview of ciao and its design philosophy

Theory and Practice of Logic Programming - Prolog Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes a framework to combine tabling evaluation and constraint logic programming (TCLP). While this combination has been studied previously from a theoretical point of view and some implementations exist, they either suffer from a lack of efficiency, flexibility, or generality, or have inherent limitations with respect to the programs they can execute to completion (either with success or failure). Our framework addresses these issues directly, including the ability to check for answer / call entailment, which allows it to terminate in more cases than other approaches. The proposed framework is experimentally compared with existing solutions in order to provide evidence of the mentioned advantages.