A Modelling Pearl with Sortedness Constraints
Number of Authors: 7
2015 (English)Conference paper (Refereed)
Some constraint programming solvers and constraint modelling languages feature the Sort(L,P,S) constraint, which holds if S is a nondecreasing rearrangement of the list L, the permutation being made explicit by the optional list P. However, such sortedness constraints do not seem to be used much in practice. We argue that reasons for this neglect are that it is impossible to require the underlying sort to be stable, so that Sort cannot be guaranteed to be a total-function constraint, and that L cannot contain tuples of variables, some of which form the key for the sort. To overcome these limitations, we introduce the StableKeysort constraint, decompose it using existing constraints, and propose a propagator. This new constraint enables a powerful modelling idiom, which we illustrate by elegant and scalable models of two problems that are otherwise hard to encode as constraint programs.
Place, publisher, year, edition, pages
2015, 9. 27-41 p.
Computer and Information Science
IdentifiersURN: urn:nbn:se:ri:diva-24472OAI: oai:DiVA.org:ri-24472DiVA: diva2:1043556
Global Conference on Artificial Intelligence