OLD Resolution with Tabulation
Proceedings of the Third International Conference on Logic Programming
Generating Propagation Rules for Finite Domains: A Mixed Approach
Selected papers from the Joint ERCIM/Compulog Net Workshop on New Trends in Contraints
Proving Termination of Constraint Solver Programs
Selected papers from the Joint ERCIM/Compulog Net Workshop on New Trends in Contraints
Inductive constraint logic programming: An overview
PRICAI '96 Selected Papers from the Workshop on Reasoning with Incomplete and Changing Information and on Inducing Complex Representations: Learning and Reasoning with Complex Representations
Automatic Generation of Propagation Rules for Finite Domains
CP '02 Proceedings of the 6th 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
Induction of Constraint Logic Programs
ALT '96 Proceedings of the 7th International Workshop on Algorithmic Learning Theory
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
Indexical-Based Solver Learning
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Automatic generation of rule-based constraint solvers over finite domains
ACM Transactions on Computational Logic (TOCL)
Automatic generation of CHR constraint solvers
Theory and Practice of Logic Programming
Generation of Rule-Based Constraint Solvers: Combined Approach
Logic-Based Program Synthesis and Transformation
Constraint solver synthesis using tabled resolution for constraint logic programming
LOPSTR'02 Proceedings of the 12th international conference on Logic based program synthesis and transformation
A note on redundant rules in rule-based constraint programming
ERCIM'02/CologNet'02 Proceedings of the 2002 Joint ERCIM/CologNet international conference on Constraint solving and constraint logic programming
| Hi-index | 0.00 |
A difficulty that arises frequently when writing a constraint solver is to determine the constraint propagation and simplification algorithm. In previous work, different methods for automatic generation of propagation rules [5,17,3] and simplification rules [4] for constraints defined over finite domains have been proposed. In this paper, we present a method for generating rule-based solvers for constraint predicates defined by means of a constraint logic program, even when the constraint domain is infinite. This approach can be seen as a concrete step towards Inductive Constraint Solving.