Composition Operators for Constraint Propagation:An Application to Choco

  • Laurent Granvilliers
  • Eric Monfroy
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2239)


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 [8]are the most well-known techniques for constraint propagation.


Composition Operator Constraint Satisfaction Problem Constraint Propagation Global Constraint Reduction Function 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Krzysztof R. Apt.The Essence of Constraint Propagation. Theoretical Computer Science,221(1–2):179–210,1999.zbMATHMathSciNetGoogle Scholar
  2. 2.
    Krzysztof R. Apt.The Role of Commutativit in Constraint Propagation Algorithms. ACM Transactions on Programming Languages and Systems,22(6):1002–1036,2000.CrossRefGoogle Scholar
  3. 3.
    Laurent Granvilliers.On the Combination of Interval Constraint Solvers. Reliable Computing,7(6):467–483,2001.Google Scholar
  4. 4.
    Laurent Granvilliers and Gaétan Hains.A Conservative Scheme for Parallel Interval Narrowing. Information Processing Letters,74:141–146,2000.CrossRefMathSciNetGoogle Scholar
  5. 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. 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
  7. 7.
    Olivier Lhomme, Arnaud Gotlieb,and Michel Rueher.Dynamic Optimization of Interval Narrowing Algorithms. Journal of Logic Programming,37(1–2):165–183, 1998.zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Alan K. Mackworth.Consistenc in Networks of Relations. Artificial Intelligence, 8(1):99–118,1977.zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Laurent Granvilliers
    • 1
  • Eric Monfroy
    • 1
  1. 1.IRIN -Universit of NantesNantes cedex 3France

Personalised recommendations