Sciweavers

19
Voted
CPAIOR
2006
Springer

Open Constraints in a Closed World

13 years 10 months ago
Open Constraints in a Closed World
We study domain filtering algorithms for open constraints, i.e., constraints that are not a priori defined on specific sets of variables. We present an efficient filtering algorithm, achieving set-domain consistency, for open global cardinality constraints. We extend this result to conjunctions of them, in case they are defined on disjoint sets of variables. We also analyze the case when the sets of variables may overlap. As establishing set-domain consistency is NP-complete in that case, we propose a weaker, though efficient, filtering algorithm instead. Finally, we extend our results to conjunctions of similar open constraints.
Willem Jan van Hoeve, Jean-Charles Régin
Added 20 Aug 2010
Updated 20 Aug 2010
Type Conference
Year 2006
Where CPAIOR
Authors Willem Jan van Hoeve, Jean-Charles Régin
Comments (0)