Decompositions of All Different, Global Cardinality and Related Constraints

Details Decompositions of All Different, Global Cardinality and Related Constraints Decompositions of All Different, Global Cardinality and Related Constraints

2009-05-22

arxiv.org/abs/0905.3755v1

IJCAI-2009

Computer Science

Artificial Intelligence

Proceedings of the Twenty-first International Joint Conference on Artificial Intelligence (IJCAI-09)

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Decompositions of All Different, Global Cardinality and Related Constraints does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Decompositions of All Different, Global Cardinality and Related Constraints, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Decompositions of All Different, Global Cardinality and Related Constraints will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-498859