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
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
Constraint handling rules: the story so far
Proceedings of the 8th ACM SIGPLAN international conference on Principles and practice of declarative programming
Semi-automatic Generation of CHR Solvers for Global Constraints
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Generation of Rule-Based Constraint Solvers: Combined Approach
Logic-Based Program Synthesis and Transformation
Constructing Rule-Based Solvers for Intentionally-Defined Constraints
Constraint Handling Rules
Guard Reasoning in the Refined Operational Semantics of CHR
Constraint Handling Rules
LOPSTR'06 Proceedings of the 16th international conference on Logic-based program synthesis and transformation
Explaining constraint programming
Processes, Terms and Cycles
Probabilistic termination of CHRiSM programs
LOPSTR'11 Proceedings of the 21st international conference on Logic-Based Program Synthesis and Transformation
Linear-Logic Based Analysis of Constraint Handling Rules with Disjunction
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
In this paper, we present a framework for automatic generation of CHR solvers given the logical specification of the constraints. 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 (Apt and Monfroy 1999; Ringeissen and Monfroy 2000; Abdennadher and Rigotti 2000; Abdennadher and Rigotti 2001a), 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) that can be used directly as CHR solvers.