Constraint solver synthesis using tabled resolution for constraint logic programming

Authors:
Slim Abdennadher;Christophe Rigotti
Affiliations:
Computer Science Department, University of Munich, München, Germany;Laboratoire d'Ingénierie des Systèmes d'Information, Villeurbanne Cedex, France
Venue:
LOPSTR'02 Proceedings of the 12th international conference on Logic based program synthesis and transformation
Year:
2002

Citing 11
Cited 0

Memoing for logic programs

Communications of the ACM
Negation and constraint logic programming

Information and Computation
A proof theoretic view of constraint programming

Fundamenta Informaticae - Special issue on foundations of constraint programming
OLD Resolution with Tabulation

Proceedings of the Third International Conference on Logic Programming
Operational Equivalence of CHR Programs and Constraints

CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Towards Inductive Constraint Solving

CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Constructive Disjunction Revisited

KI '96 Proceedings of the 20th Annual German Conference on Artificial Intelligence: Advances in Artificial Intelligence
CHRv: A Flexible Query Language

FQAS '98 Proceedings of the Third International Conference on Flexible Query Answering Systems
Automatic Generation of Constraint Propagation Algorithms for Small Finite Domains

CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Using confluence to generate rule-based constraint solvers

Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming
Automatic generation of rule-based constraint solvers over finite domains

ACM Transactions on Computational Logic (TOCL)

Quantified Score

Hi-index	0.00

Visualization

Abstract

The goal of automated program synthesis is to bridge the gap between what is easy for people to describe and what is possible to execute on a computer. In this paper, we present a framework for synthesis of rule-based solvers for constraints given their logical specification. This approach takes advantage of the power of tabled resolution for constraint logic programming, in order to check the validity of the rules. Compared to previous work [8,19,2,5,3], where different methods for automatic generation of constraint solvers have been proposed, our approach enables the generation of more expressive rules (even recursive and splitting rules).