A Modelling Pearl with Sortedness Constraints

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.

Carlsson, MatsRISE,Computer Systems Laboratory(Swepub:ri)MatsCa@ri.se (författare)
Flener, PierreUppsala University, Sweden (författare)
Lorca, XavierÉcole des Mines de Nantes, France (författare)
Pearson, JustinUppsala University, Sweden (författare)
Petit, ThierryÉcole des Mines de Nantes, France; Worcester Polytechnic Institute, US (författare)
Prud'homme, CharlesÉcole des Mines de Nantes, France (författare)
École des Mines de Nantes, FranceComputer Systems Laboratory (creator_code:org_t)

Ingår i:GCAI 2015. Global Conference on Artificial Intelligence: EasyChair, s. 27-41

Av författaren/redakt...: Beldiceanu, Nico ...; Carlsson, Mats; Flener, Pierre; Lorca, Xavier; Pearson, Justin; Petit, Thierry; visa fler...; Prud'homme, Char ...; visa färre...

Om ämnet

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.