Abstract
We describe how the propagator for the All-Different constraint can be generalized to prune variables whose domains are not just simple finite integer domains. We show, for example, how it can be used to propagate set, multiset and tuple variables.
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
Hall, P.: On representatives of subsets. Journal of the London Mathematical Society, 26–30 (1935)
Hopcroft, J., Karp, R.: An n 5/2 algorithm for maximum matchings in bipartite graphs. SIAM Journal of Computing 2, 225–231 (1973)
Ilog, S.A.: ILOG Solver 4.2 user’s manual (1998)
Régin, J.-C.: A filtering algorithm for constraints of difference in CSPs. In: Proc. of the 12th National Conference on Artificial Intelligence, pp. 362–367 (1994)
Stergiou, K., Walsh, T.: The difference all-difference makes. In: Proc. of the 16th Int. Joint Conference on Artificial Intelligence, pp. 414–419 (1999)
Sadler, A., Gervet, C.: Hybrid Set Domains to Strengthen Constraint Propagation and Reduce Symmetries. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 604–618. Springer, Heidelberg (2004)
Knuth, D.: The Art of Computer Programming, vol. 4, Pre-Fascicle 2a: Generating all n-tuples, http://www-cs-faculty.stanford.edu/~knuth/
Knuth, D.: The Art of Computer Programming, vol. 4, Pre-Fascicle 3a: Generating all combinations, http://www-cs-faculty.stanford.edu/~knuth/
López-Ortiz, A., Quimper, C.-G., Tromp, J., van Beek, P.: A fast and simple algorithm for bounds consistency of the alldifferent constraint. In: Proc. of the 18th Int. Joint Conference on Artificial Intelligence, pp. 245–250 (2003)
Press, W.H., Flannery, B.P., Teukolsky, S.A., Vetterling, W.T.: Numerical Recipes in C: The Art of Scientific Computing, 2nd edn. Cambridge University Press, Cambridge (1992)
Gervet, C.: Interval Propagation to Reason about Sets: Definition and Implementation of a Practical Language. CONSTRAINTS journal 1(3), 191–244 (1997)
Puget, J.-F.: Finite set intervals. In: Proc. of Workshop on Set Constraints, CP 1996 (1996)
Müller, T., Müller, M.: Finite set constraints in Oz. In: Bry, F., Freitag, B., Seipel, D. (eds.) Workshop Logische Programmierung, Technische Universität München, September 17–19, pp. 104–115 (1997)
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)
Gent, I.P., Walsh, T.: CSPLib: a benchmark library for constraints Technical report APES-09-1999 (1999)
Leconte, M.: A bounds-based reduction scheme for constraints of difference. In: Proceedings of the Constraint 1996 International Workshop on Constraint-Based Reasoning, pp. 19–28 (1996)
Puget, J.-F.: A Fast Algorithm for the Bound Consistency of Alldiff Constraints. In: Proc. of the 15th National Conf. on Artificiel Intelligence, pp. 359–366 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Quimper, CG., Walsh, T. (2005). Beyond Finite Domains: The All Different and Global Cardinality Constraints. In: van Beek, P. (eds) Principles and Practice of Constraint Programming - CP 2005. CP 2005. Lecture Notes in Computer Science, vol 3709. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11564751_70
Download citation
DOI: https://doi.org/10.1007/11564751_70
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29238-8
Online ISBN: 978-3-540-32050-0
eBook Packages: Computer ScienceComputer Science (R0)