Self-decomposable Global Constraints

Scalability becomes more and more critical to decision support technologies. In order to address this issue in Constraint Programming, we introduce the family of self-decomposable constraints. These constraints can be satisfied by applying their own filtering algorithms on variable subsets only. We introduce a generic framework which dynamically decompose propagation, by filtering over variable subsets. Our experiments over the CUMULATIVE constraint illustrate the practical relevance of self-decomposition.

Authors

• Jean-Guillaume Fages
• Xavier Lorca
• Thierry Petit

Keywords

No keywords are indexed for this paper.