Embedding boolean expressions into logic programming
Journal of Symbolic Computation
Rule-based constraint programming
Fundamenta Informaticae - Special issue on foundations of constraint programming
Building constraint satisfaction problem solvers using rewrite rules and strategies
Fundamenta Informaticae - Special issue on foundations of constraint programming
A proof theoretic view of constraint programming
Fundamenta Informaticae - Special issue on foundations of constraint programming
The essence of constraint propagation
Theoretical Computer Science
A Methodological View of Constraint Solving
Constraints
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
Automatic Generation of Propagation Rules for Finite Domains
CP '02 Proceedings of the 6th 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
Generation of Rule-Based Constraint Solvers: Combined Approach
Logic-Based Program Synthesis and Transformation
Explaining constraint programming
Processes, Terms and Cycles
| Hi-index | 0.00 |
Constraint solving techniques are frequently based on constraint propagation, a technique that can be seen as a specific form of deduction. Using constraint programming languages enhanced with constraint handling rules facilities, constraint propagation can be achieved just by applying deduction rules to constraints. The automatic generation of propagation rules has been recently investigated in the particular case of finite domains, when constraint satisfaction problems are based on predefined, explicitly given constraints. Due to its interest for practical applications, several solvers have been developed during the last decade for integrating finite domains into (constraint) logic programming. A possible way of integration is implemented using a unification algorithm to compute most general solutions of constraints. In this paper, we propose a mixed approach for designing finite domain constraints solvers: it consists in using a solver based on unification to improve the generation of propagation rules.