Filtering Algorithms for the Multiset Ordering Constraint

Details Filtering Algorithms for the Multiset Ordering Constraint Filtering Algorithms for the Multiset Ordering Constraint

2009-03-03

arxiv.org/abs/0903.0460v1

Artificial Intelligence, 173 (2), 299-328, 2009

Computer Science

Artificial Intelligence

Scientific paper

10.1016/j.artint.2008.11.001

Constraint programming (CP) has been used with great success to tackle a wide variety of constraint satisfaction problems which are computationally intractable in general. Global constraints are one of the important factors behind the success of CP. In this paper, we study a new global constraint, the multiset ordering constraint, which is shown to be useful in symmetry breaking and searching for leximin optimal solutions in CP. We propose efficient and effective filtering algorithms for propagating this global constraint. We show that the algorithms are sound and complete and we discuss possible extensions. We also consider alternative propagation methods based on existing constraints in CP toolkits. Our experimental results on a number of benchmark problems demonstrate that propagating the multiset ordering constraint via a dedicated algorithm can be very beneficial.

Affiliated with

Also associated with

No associations

Rating

Filtering Algorithms for the Multiset Ordering Constraint 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 Filtering Algorithms for the Multiset Ordering Constraint, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Filtering Algorithms for the Multiset Ordering Constraint will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-652733