Abstract. This report presents a generic filtering scheme, based on the graph description of global constraints. This description is defined by a network of binary constraints and ...
Nicolas Beldiceanu, Mats Carlsson, Sophie Demassey...
We argue that parameterized complexity is a useful tool with which to study global constraints. In particular, we show that many global constraints which are intractable to propag...
Christian Bessiere, Emmanuel Hebrard, Brahim Hnich...
Scheduling is one of the most successful application areas of constraint programming mainly thanks to special global constraints designed to model resource restrictions. Among thes...
Constraint programming offers a variety of modeling objects such as logical and global constraints, that lead to concise and clear models for expressing combinatorial optimization...
This paper shows that existing definitions of costs associated with soft global constraints are not sufficient to deal with all the usual global constraints. We propose more expre...
The paper introduces value precedence on integer and set sequences. A useful application of the notion is in breaking symmetries of indistinguishable values, an important class of ...
Abstract. Constraint propagation is one of the techniques central to the success of constraint programming. Fast algorithms are used to prune the search space either before or duri...
We have started a systematic study of global constraints on set and multiset variables. We consider here disjoint, partition, and intersection constraints in conjunction with cardi...
Integrity constraints are valuable tools for enforcing consistency of data in a database. Global integrity constraints ensure integrity and consistency of data spanning multiple d...
This paper reconsiders the problems of discovering symmetries in constraint satisfaction problems (CSPs). It proposes a compositional approach which derives symmetries of the appli...
Pascal Van Hentenryck, Pierre Flener, Justin Pears...