Self-decomposable Global Constraints

Jean-Guillaume Fages 1, 2 Xavier Lorca 1, 2 Thierry Petit 2, 1
1 TASC - Theory, Algorithms and Systems for Constraints
LINA - Laboratoire d'Informatique de Nantes Atlantique, Département informatique - EMN, Inria Rennes – Bretagne Atlantique
Abstract : 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.
Complete list of metadatas

Cited literature [14 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01088964
Contributor : Thierry Petit <>
Submitted on : Saturday, November 29, 2014 - 5:35:28 PM
Last modification on : Friday, June 22, 2018 - 9:31:58 AM
Long-term archiving on : Friday, April 14, 2017 - 11:26:51 PM

File

ECAI-126.pdf
Files produced by the author(s)

Identifiers

Citation

Jean-Guillaume Fages, Xavier Lorca, Thierry Petit. Self-decomposable Global Constraints. ECAI 2014, 21st International Conference on Artificial Intelligence, Aug 2014, Prague, Czech Republic. pp.297-302, ⟨10.3233/978-1-61499-419-0-297⟩. ⟨hal-01088964⟩

Share

Metrics

Record views

498

Files downloads

150