Output details

Filtering algorithms for the multiset ordering constraint

<22> This 30-page paper significantly extends the

influential 6-page IJCAI'03 paper (20.75% acceptance, not RAE2008

returned) by introducing a second propagation algorithm, which is faster if

domains are large; adding algorithms to detect entailment and

propagate a strict ordering constraint; presenting an extensive and thorough

theoretical treatment, including correctness and complexity proofs; and

demonstrating experimentally the superiority of our algorithms over

alternative approaches. This strand of work introduced to constraint

programming the use of the multiset-ordering constraint to break

symmetries in matrices with row and/or column symmetry. Today it is

one of two constraints universally used to break such symmetries.