Multiset Ordering Constraints
Abstract
We identify a new and important global (or nonbinary) constraint which 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 a linear time algorithm for enforcing generalised arc-consistency on such a multiset ordering constraint. Experimental results show considerable promise.
Cite
Text
Frisch et al. "Multiset Ordering Constraints." International Joint Conference on Artificial Intelligence, 2003.Markdown
[Frisch et al. "Multiset Ordering Constraints." International Joint Conference on Artificial Intelligence, 2003.](https://mlanthology.org/ijcai/2003/frisch2003ijcai-multiset/)BibTeX
@inproceedings{frisch2003ijcai-multiset,
title = {{Multiset Ordering Constraints}},
author = {Frisch, Alan M. and Miguel, Ian and Kiziltan, Zeynep and Hnich, Brahim and Walsh, Toby},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2003},
pages = {221-226},
url = {https://mlanthology.org/ijcai/2003/frisch2003ijcai-multiset/}
}