The all different and global cardinality constraints on set, multiset and tuple variables

Authors:
Claude-Guy Quimper;Toby Walsh
Affiliations:
School of Computer Science, University of Waterloo, Canada;NICTA and UNSW, Sydney, Australia
Venue:
CSCLP'05 Proceedings of the 2005 Joint ERCIM/CoLogNET international conference on Constraint Solving and Constraint Logic Programming
Year:
2005

Citing 6
Cited 2

Numerical recipes in C (2nd ed.): the art of scientific computing

Numerical recipes in C (2nd ed.): the art of scientific computing
A filtering algorithm for constraints of difference in CSPs

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
A fast algorithm for the bound consistency of alldiff constraints

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
The difference all-difference makes

IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
A fast and simple algorithm for bounds consistency of the all different constraint

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Generalized arc consistency for global cardinality constraint

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1

Advisors for incremental propagation

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
The extended global cardinality constraint: An empirical survey

Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

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.