Abstract
We describe how the propagator for the All-Different constraint can be generalized to prune variables whose domains are not just simple finite domains. We show, for example, how it can be used to propagate set variables, multiset variables and variables which represent tuples of values. We also describe how the propagator for the global cardinality constraint (which is a generalization of the All-Different constraint) can be generalized in a similar way. Experiments show that such propagators can be beneficial in practice, especially when the domains are large.
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
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: Proceedings of the Twelfth National Conference on Artificial Intelligence, Seattle, pp. 362–367 (1994)
Régin, J.-C.: Generalized arc consistency for global cardinality constraint. In: Proceedings of the Thirteenth National Conference on Artificial Intelligence, Portland, Oregon, pp. 209–215 (1996)
Stergiou, K., Walsh, T.: The difference all-difference makes. In: Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, Stockholm, pp. 414–419 (1999)
Sadler, A., Gervet, C.: Hybrid Set Domains to Strengthen Constraint Propagation and Reduce Symmetries. In: Proceedings of the 10th International Conference on Principles and Practice of Constraint Programming, Toronto, Canada, pp. 604–618 (2004)
Knuth, D.: Generating All Tuples and Permutations, p. 144. Addison-Wesley, Reading (2005)
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: Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, Acapulco, Mexico, 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)
Régin, J.-C., Gomes, C.P.: The Cardinality Matrix Constraint. In: Proceedings of the 10th International Conference on Principles and Practice of Constraint Programming, Toronto, Canada, pp. 572–587 (2004)
Gervet, C.: Interval Propagation to Reason about Sets: Definition and Implementation of a Practical Language. Constraints Journal 1(3), 191–244 (1997)
Gervet, C.: Set Intervals in Constraint Logic Programming: Definition and Implementation of a Language. PhD thesis, Université de Franche-Comté, France, European thesis (September 1995) (in English)
Puget, J.-F.: Finite set intervals. In: Proceedings of Workshop on Set Constraints, held at CP 1996 (1996)
Müller, T., Müller, M.: Finite set constraints in Oz. In: Bry, F., Freitag, B., Seipel, D. (eds.) 13. Workshop Logische Programmierung, Technische Universität München, September 17–19, 1997, pp. 104–115 (1997)
Walsh, T.: Consistency and Propagation with Multiset Constraints: A Formal Viewpoint. In: Proceedings of the 9th International Conference on Principles and Practice of Constraint Programming, Kinsale, Ireland (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)
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: Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI 2003), pp. 245–250 (2003)
Puget, J.-F.: A Fast Algorithm for the Bound Consistency of Alldiff Constraints. In: Proceedings of the 15th National Conference on Artificiel Intelligence (AAAI 1998) and 10th Conference on Innovation Applications of Artificial Intelligence (IAAI 1998), pp. 359–366 (1998)
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
Quimper, CG., Walsh, T. (2006). The All Different and Global Cardinality Constraints on Set, Multiset and Tuple Variables. In: Hnich, B., Carlsson, M., Fages, F., Rossi, F. (eds) Recent Advances in Constraints. CSCLP 2005. Lecture Notes in Computer Science(), vol 3978. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11754602_1
Download citation
DOI: https://doi.org/10.1007/11754602_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34215-1
Online ISBN: 978-3-540-34216-8
eBook Packages: Computer ScienceComputer Science (R0)