28 citations · 67 across the 5 of their papers we have counts for
5 papers · 1 filter
Flow-Based Propagators for the SEQUENCE and Related Global Constraints
Michael J. Maher, Nina Narodytska, Claude-Guy Quimper +1
We propose new filtering algorithms for the SEQUENCE constraint and some extensions of the SEQUENCE constraint based on network flows. We enforce domain consistency on the SEQUENCE…
Decomposition of the NVALUE constraint
Christian Bessiere, George Katsirelos, Nina Narodytska +2
We study decompositions of NVALUE, a global constraint that can be used to model a wide range of problems where values need to be counted. Whilst decomposition typically hinders pr…
Decompositions of All Different, Global Cardinality and Related Constraints
Christian Bessiere, George Katsirelos, Nina Narodytska +2
We show that some common and important global constraints like ALL-DIFFERENT and GCC can be decomposed into simple arithmetic constraints on which we achieve bound or range consist…
Decompositions of Grammar Constraints
Claude-Guy Quimper, Toby Walsh
A wide range of constraints can be compactly specified using automata or formal languages. In a sequence of recent papers, we have shown that an effective means to reason with such…
The Parameterized Complexity of Global Constraints
Christian Bessiere, Emmanuel Hebrard, Brahim Hnich +2
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 propaga…