Multiset Ordering Constraints
نویسندگان
چکیده
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.
منابع مشابه
Constraint Programming with Multisets
We propose extending constraint solvers with multiset variables. That is, variables whose values are multisets. Such an extension can help prevent introducing unnecessary symmetry into a model. We identify a number of different representations for multiset variables, and suggest primitive and global constraints on multiset variables. Surprisingly, unlike finite domain variables, decomposition o...
متن کاملTheorem Proving with Sequence Variables and Flexible Arity Symbols
An ordering for terms with sequence variables and flexible arity symbols is presented. The ordering coincides with the lexicographic extension of multiset path ordering on terms without sequence variables. It is shown that the classical strict superposition calculus with ordering and equality constraints can be used as a refutationally complete proving method for well-constrained sets of clause...
متن کاملOn the Formalization of Termination Techniques based on Multiset Orderings
Multiset orderings are a key ingredient in certain termination techniques like the recursive path ordering and a variant of size-change termination. In order to integrate these techniques in a certifier for termination proofs, we have added them to the Isabelle Formalization of Rewriting. To this end, it was required to extend the existing formalization on multiset orderings towards a generaliz...
متن کاملAn Alternative Proof of the Well-Foundedness of the Nested Multiset Ordering
This research note outlines an alternative proof of the well-foundedness of the nested multiset ordering. It is first shown that the set M∗(S) of nested multisets over a given base set S forms a cumulative type structure. Then, by exploiting the notion of sets bounded in rank, it is proved that (M∗(S), >>∗) is well-founded if and only if (S, >) is well-founded, where >>∗denotes a nested multise...
متن کاملStatic Symmetry Breaking with the Reflex Ordering
LexLeader, a state of the art static symmetry breaking method, adds a lex ordering constraint for each variable symmetry of the problem to select the lexicographically least solution. In practice, the same method can also be used for partial symmetry breaking by breaking only a given subset of symmetries. We propose a new total ordering, reflex, as basis of a new symmetry breaking constraint th...
متن کامل