42 citations · 70 across the 4 of their papers we have counts for
4 papers
The Complexity of Reasoning with Global Constraints
Christian Bessiere, Emmanuel Hebrard, Brahim Hnich +1
Constraint propagation is one of the techniques central to the success of constraint programming. To reduce search, fast algorithms associated with each constraint prune the domain…
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…
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…