View-based propagation of decomposable constraints

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)


Constraints that may be obtained by composition from simpler constraints are present, in some way or another, in almost every constraint program. The decomposition of such constraints is a standard technique for obtaining an adequate propagation algorithm from a combination of propagators designed for simpler constraints. … Traditionally, constraint solvers automatically decompose constraints into simpler ones using additional auxiliary variables and propagators, or expect the users to perform such decomposition themselves, eventually leading to the same propagation model. In this paper we explore views, an alternative way to create efficient propagators for such constraints in a modular, simple and correct way, which avoids the introduction of auxiliary variables and propagators.
Original languageUnknown
Pages (from-to)579-608
Issue number4
Publication statusPublished - 1 Jan 2013

Cite this