GCC-like restrictions on the same constraint

Authors:
Nicolas Beldiceanu;Irit Katriel;Sven Thiel
Affiliations:
LINA FRE CNRS 2729, École des Mines de Nantes, Nantes Cedex 3, France;Max-Planck-Institut für Informatik, Saarbrücken, Germany;Max-Planck-Institut für Informatik, Saarbrücken, Germany
Venue:
CSCLP'04 Proceedings of the 2004 joint ERCIM/CoLOGNET international conference on Recent Advances in Constraints
Year:
2004

Citing 4
Cited 1

Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
A filtering algorithm for constraints of difference in CSPs

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Faster Algorithms for Bound-Consistency of the Sortedness and the Alldifferent Constraint

CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Generalized arc consistency for global cardinality constraint

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

Global Constraint Catalogue: Past, Present and Future

Constraints

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Same constraint takes two sets of variables X and Z such that |X|=|Z| and assigns values to them such that the multiset of values assigned to the variables in X is equal to the multiset of values assigned to the variables in Z. In this paper we extend the Same constraint in a GCC-like manner by adding cardinality requirements on the values. That is, for each value we have a lower and upper bound on the number of variables that can be assigned this value. We show an algorithm that achieves arc-consistency for this constraint and a faster algorithm that achieves bound-consistency for a restricted case of it.