GCC-like restrictions on the Same constraint

1Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Beldiceanu, N., Katriel, I., & Thiel, S. (2005). GCC-like restrictions on the Same constraint. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3419 LNAI, pp. 1–11). https://doi.org/10.1007/11402763_1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free