Propagating Conjunctions of AllDifferent Constraints

Details Propagating Conjunctions of AllDifferent Constraints Propagating Conjunctions of AllDifferent Constraints

2010-04-15

arxiv.org/abs/1004.2626v1

Computer Science

Artificial Intelligence

AAAI 2010, Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence

Scientific paper

We study propagation algorithms for the conjunction of two AllDifferent constraints. Solutions of an AllDifferent constraint can be seen as perfect matchings on the variable/value bipartite graph. Therefore, we investigate the problem of finding simultaneous bipartite matchings. We present an extension of the famous Hall theorem which characterizes when simultaneous bipartite matchings exists. Unfortunately, finding such matchings is NP-hard in general. However, we prove a surprising result that finding a simultaneous matching on a convex bipartite graph takes just polynomial time. Based on this theoretical result, we provide the first polynomial time bound consistency algorithm for the conjunction of two AllDifferent constraints. We identify a pathological problem on which this propagator is exponentially faster compared to existing propagators. Our experiments show that this new propagator can offer significant benefits over existing methods.

Affiliated with

Also associated with

No associations

Rating

Propagating Conjunctions of AllDifferent 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 Propagating Conjunctions of AllDifferent Constraints, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Propagating Conjunctions of AllDifferent Constraints will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-380129