Decompositions of All Different, Global Cardinality and Related Constraints

Simple item page
dc.creatorBessiere, Christian
dc.creatorKatsirelos, George
dc.creatorNarodytska, Nina
dc.creatorQuimper, Claude-Guy
dc.creatorWalsh, Toby
dc.date2009-05-22
dc.date.accessioned2026-07-07T13:17:44Z
dc.date.available2026-07-07T13:17:44Z
dc.descriptionWe show that some common and important global constraints like ALL-DIFFERENT and GCC can be decomposed into simple arithmetic constraints on which we achieve bound or range consistency, and in some cases even greater pruning. These decompositions can be easily added to new solvers. They also provide other constraints with access to the state of the propagator by sharing of variables. Such sharing can be used to improve propagation between constraints. We report experiments with our decomposition in a pseudo-Boolean solver.
dc.descriptionProceedings of the Twenty-first International Joint Conference on Artificial Intelligence (IJCAI-09)
dc.identifierhttps://arxiv.org/abs/0905.3755
dc.identifierhttp://arxiv.org/abs/0905.3755
dc.identifierIJCAI-2009
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/231211
dc.subjectArtificial Intelligence
dc.subjectI.2.4
dc.titleDecompositions of All Different, Global Cardinality and Related Constraints
dc.typetext

Files

Collections

arXiv