Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows. Prentice Hall, Englewood Cliffs (1993)
Barták, R.: Dynamic Global Constraints in Backtracking Based Environments. Annals of Operations Research 118(1–4), 101–119 (2003)
Elbassioni, K., Katriel, I., Kutz, M., Mahajan, M.: Simultaneous matchings. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol. 3827, pp. 106–115. Springer, Heidelberg (2005)
Faltings, B., Macho-Gonzalez, S.: Open Constraint Satisfaction. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 356–370. Springer, Heidelberg (2002)
Faltings, B., Macho-Gonzalez, S.: Open Constraint Programming. Artificial Intelligence 161(1–2), 181–208 (2005)
van Hoeve, W.-J., Pesant, G., Rousseau, L.-M.: On Global Warming: Flow-Based Soft Global Constraints. Journal of Heuristics (to appear, 2006)
Régin, J.-C.: Generalized Arc Consistency for Global Cardinality Constraint. In: Proceedings of AAAI/IAAI, vol. 1, pp. 209–215. AAAI Press/The MIT Press (1996)
Régin, J.-C.: Cost-Based Arc Consistency for Global Cardinality Constraints. Constraints 7, 387–405 (2002)
Tarjan, R.: Depth-first search and linear graph algorithms. SIAM Journal on Computing 1, 146–160 (1972)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
van Hoeve, WJ., Régin, JC. (2006). Open Constraints in a Closed World. In: Beck, J.C., Smith, B.M. (eds) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. CPAIOR 2006. Lecture Notes in Computer Science, vol 3990. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11757375_20
Download citation
DOI: https://doi.org/10.1007/11757375_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34306-6
Online ISBN: 978-3-540-34307-3
eBook Packages: Computer ScienceComputer Science (R0)