Constraint satisfaction in logic programming
Constraint satisfaction in logic programming
Temporal logic for real time systems
Temporal logic for real time systems
The CLP( R ) language and system
ACM Transactions on Programming Languages and Systems (TOPLAS)
A minimal extension of the WAM for clp(FD)
ICLP'93 Proceedings of the tenth international conference on logic programming on Logic programming
Automatic synthesis of optimal invariant assertions: Mathematical foundations
Proceedings of the 1977 symposium on Artificial intelligence and programming languages
Extending GENET for Non-Binary Constraint Satisfaction Problems
TAI '95 Proceedings of the Seventh International Conference on Tools with Artificial Intelligence
A generic customizable framework for inverse local consistency
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Functional elimination and 0/1/All constraints
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Building Constraint Solvers with HAL
Proceedings of the 17th International Conference on Logic Programming
Propagation Completeness of Reactive Constraints
ICLP '02 Proceedings of the 18th International Conference on Logic Programming
Promoting Constraints to First-Class Status
CL '00 Proceedings of the First International Conference on Computational Logic
To the Gates of HAL: A HAL Tutorial
FLOPS '02 Proceedings of the 6th International Symposium on Functional and Logic Programming
A Geometric Constraint over k-Dimensional Objects and Shapes Subject to Business Rules
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Predicate abstraction of programs with non-linear computation
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
| Hi-index | 0.00 |
Propagation based finite domain solvers provide a general mechanism for solving combinatorial problems. Different propagation methods can be used in conjunction by communicating through the domains of shared variables. The flexibility that this entails has been an important factor in the success of propagation based solving for solving hard combinatorial problems. In this paper we investigate how linear integer constraints should be represented in order that propagation can determine strong domain information. We identify two kinds of substitution which can improve propagation solvers, and can never weaken the domain information. This leads us to an alternate approach to propagation based solving where the form of constraints is modified by substitution as computation progresses. We compare and contrast a solver using substitution against an indexical based solver, the current method of choice for implementing propagation based constraint solvers, identifying the the relative advantages and disadvantages of the two approaches.