42 citations · 101 across the 5 of their papers we have counts for
5 papers · 1 filter
Multiset Ordering Constraints
Alan M. Frisch, Ian Miguel, Zeynep Kiziltan +2
We identify a new and important global (or non-binary) constraint. This constraint ensures that the values taken by two vectors of variables, when viewed as multisets, are ordered.…
SLIDE: A Useful Special Case of the CARDPATH Constraint
Christian Bessiere, Emmanuel Hebrard, Brahim Hnich +2
We study the CardPath constraint. This ensures a given constraint holds a number of times down a sequence of variables. We show that SLIDE, a special case of CardPath where the sli…
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…
Filtering Algorithms for the Multiset Ordering Constraint
Alan Frisch, Brahim Hnich, Zeynep Kiziltan +2
Constraint programming (CP) has been used with great success to tackle a wide variety of constraint satisfaction problems which are computationally intractable in general. Global c…
Range and Roots: Two Common Patterns for Specifying and Propagating Counting and Occurrence Constraints
Christian Bessiere, Emmanuel Hebrard, Brahim Hnich +2
We propose Range and Roots which are two common patterns useful for specifying a wide range of counting and occurrence constraints. We design specialised propagation algorithms for…