Decompositions of All Different, Global Cardinality and Related Constraints
Artificial Intelligence
2009-05-26 v1
Abstract
We 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.
Keywords
Cite
@article{arxiv.0905.3755,
title = {Decompositions of All Different, Global Cardinality and Related Constraints},
author = {Christian Bessiere and George Katsirelos and Nina Narodytska and Claude-Guy Quimper and Toby Walsh},
journal= {arXiv preprint arXiv:0905.3755},
year = {2009}
}
Comments
Proceedings of the Twenty-first International Joint Conference on Artificial Intelligence (IJCAI-09)