pith. sign in

arxiv: 0905.3769 · v1 · submitted 2009-05-22 · 💻 cs.AI

Multiset Ordering Constraints

classification 💻 cs.AI
keywords constraintmultisetorderingalgorithmapplicationsbreakingconsiderableconsistency
0
0 comments X
read the original abstract

We identify a new and important global (or non-binary) constraint. This constraint ensures that the values taken by two vectors of variables, when viewed as multisets, are ordered. This constraint is useful for a number of different applications including breaking symmetry and fuzzy constraint satisfaction. We propose and implement an efficient linear time algorithm for enforcing generalised arc consistency on such a multiset ordering constraint. Experimental results on several problem domains show considerable promise.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.