Abstract
We have started a systematic study of global constraints on set and multiset variables. We consider here disjoint, partition, and intersection constraints in conjunction with cardinality constraints. These global constraints fall into one of three classes. In the first class, we show that we can decompose the constraint without hindering bound consistency. No new algorithms therefore need be developed for such constraints. In the second class, we show that decomposition hinders bound consistency but we can present efficient polynomial algorithms for enforcing bound consistency. Many of these algorithms exploit a dual viewpoint, and call upon existing global constraints for finite-domain variables like the global cardinality constraint. In the third class, we show that enforcing bound consistency is NP-hard. We have little choice therefore but to enforce a lesser level of local consistency when the size of such constraints grows.
The last three authors are supported by Science Foundation Ireland and an ILOG software grant. We wish to thank Zeynep Kiziltan for useful comments.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Beldiceanu, N.: Global constraints as graph properties on a structured network of elementary constraints of the same type. In: Dechter, R. (ed.) CP 2000. LNCS, vol. 1894, pp. 52–66. Springer, Heidelberg (2000)
Bessiere, C., Hebrard, E., Hnich, B., Walsh, T.: The complexity of global constraints. In: Proc. AAAI 2004 (2004)
Gervet, C.: Conjunto: constraint logic programming with finite set domains. In: Proc. of the 1994 Int. Symp. on Logic Programming, pp. 339–358. MIT Press, Cambridge (1994)
Ilog. User’s manual. ILOG Configurator 2.3 (2004)
Ilog. User’s manual. ILOG Solver 6.0 (September 2003)
Müller, T., Müller, M.: Finite set constraints in Oz. In: 13th Logic Programming Workshop, pp. 104–115, Technische Universität München (1997)
Régin, J.-C.: A filtering algorithm for constraints of difference in CSPs. In: Proc. AAAI 1994, pp. 362–367. AAAI, Menlo Park (1994)
Régin, J.-C.: Generalized arc consistency for global cardinality constraints. In: Proc. AAAI 1996, pp. 209–215. AAAI Press/The MIT Press (1996)
Sadler, A., Gervet, C.: Global reasoning on sets. In: Proc. of Workshop on Modelling and Problem Formulation (FORMUL 2001), Held alongside CP 2001 (2001)
Sadler, A., Gervet, C.: Global Filtering for the Disjointness Constraint on Fixed Cardinality Sets. In Technical report IC-PARC-04-02, Imperial College London (March 2001)
Schimpf, J., Cheadle, A., Harvey, W., Sadler, A., Shen, K., Wallace, M.: ECLiPSe. In Technical report IC-PARC-03-01, Imperial College London (2003)
Walsh, T.: Consistency and propagation with multiset constraints: A formal viewpoint. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 724–738. Springer, Heidelberg (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bessiere, C., Hebrard, E., Hnich, B., Walsh, T. (2004). Disjoint, Partition and Intersection Constraints for Set and Multiset Variables. In: Wallace, M. (eds) Principles and Practice of Constraint Programming – CP 2004. CP 2004. Lecture Notes in Computer Science, vol 3258. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30201-8_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-30201-8_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23241-4
Online ISBN: 978-3-540-30201-8
eBook Packages: Springer Book Archive