Multiset Ordering Constraints

05/22/2009
by   Alan M. Frisch, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/19/2011

The AllDifferent Constraint with Precedences

We propose AllDiffPrecedence, a new global constraint that combines toge...
research
08/01/2013

An n-ary Constraint for the Stable Marriage Problem

We present an n-ary constraint for the stable marriage problem. This con...
research
05/04/2021

Streaming approximation resistance of every ordering CSP

An ordering constraint satisfaction problem (OCSP) is given by a positiv...
research
08/18/2017

Exploring Directional Path-Consistency for Solving Constraint Networks

Among the local consistency techniques used for solving constraint netwo...
research
11/01/1996

MUSE CSP: An Extension to the Constraint Satisfaction Problem

This paper describes an extension to the constraint satisfaction problem...
research
09/23/2021

Exact Learning of Qualitative Constraint Networks from Membership Queries

A Qualitative Constraint Network (QCN) is a constraint graph for represe...
research
11/02/2017

Weight-Based Variable Ordering in the Context of High-Level Consistencies

Dom/wdeg is one of the best performing heuristics for dynamic variable o...

Please sign up or login with your details

Forgot password? Click here to reset