Composition Operators for Constraint Propagation:An Application to Choco
A constraint satisfaction problem is defined by a set of variables associated to domains,and a set of constraints on these variables. Solving a constraint satisfaction problem consists in finding assignments of all variables that satisfy all constraints. Since this problem is NP-hard,constraint propagation has been designed to struggle against the combinatorial explosion of brute-force search by pruning domains before enumeration. Filtering algorithms enforcing consistency properties are the most well-known techniques for constraint propagation.
KeywordsComposition Operator Constraint Satisfaction Problem Constraint Propagation Global Constraint Reduction Function
Unable to display preview. Download preview PDF.
- 3.Laurent Granvilliers.On the Combination of Interval Constraint Solvers. Reliable Computing,7(6):467–483,2001.Google Scholar
- 5.Laurent Granvilliers and Eric Monfro. Enhancing constraint propagation with composition operators. In Proceedings of the ERCIM/CompulogNet Workshop on Constraints,Prague,Czech Republic,2001.Google Scholar
- 6.François Laburthe and the OCRE project team.CHOCO:implementing a CP kernel. In Proceedings of the CP’2000 workshop on techniques for implementing constraint programming systems,Singapore,2000.Google Scholar