CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
On global warming: Flow-based soft global constraints
Journal of Heuristics
Artificial Intelligence - Special issue: Distributed constraint satisfaction
Generalized arc consistency for global cardinality constraint
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Open Constraints in a Boundable World
CPAIOR '09 Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Open contractible global constraints
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
SAT Encoding and CSP Reduction for Interconnected Alldiff Constraints
MICAI '09 Proceedings of the 8th Mexican International Conference on Artificial Intelligence
SOGgy constraints: soft open global constraints
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Boosting set constraint propagation for network design
CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
| Hi-index | 0.00 |
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.