A Modelling Pearl with Sortedness Constraints - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2015

A Modelling Pearl with Sortedness Constraints

Abstract

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.
No file

Dates and versions

hal-01186680 , version 1 (25-08-2015)

Identifiers

  • HAL Id : hal-01186680 , version 1

Cite

Nicolas Beldiceanu, Mats Carlsson, Pierre Flener, Xavier Lorca, Justin Pearson, et al.. A Modelling Pearl with Sortedness Constraints. Global conference on artificial intelligence, Oct 2015, Tbilisi, Georgia. ⟨hal-01186680⟩
304 View
0 Download

Share

Gmail Facebook X LinkedIn More