Max-Planck-Institut für Informatik
max planck institut
mpii logo Minerva of the Max Planck Society


Filtering algorithms for the Same and UsedBy constraints

Beldiceanu, Nicolas and Katriel, Irit and Thiel, Sven

MPI-I-2004-1-001. February 2004, 36 pages. | Status: available - back from printing | Next --> Entry | Previous <-- Entry

Abstract in LaTeX format:
We define the \Same\ and \UsedBy\ constraints. \UsedBy\ takes
two sets of variables $X$ and $Z$ such that $|X|\ge |Z|$ and
assigns values to them such that the multiset of values assigned
to the variables in $Z$ is contained in the multiset of values
assigned to the variables in $X$. \Same\ is the special case of
\UsedBy\ in which $|X|=|Z|$.
We show algorithms that achieve arc consistency and bound
consistency for these constraints.
References to related material:

To download this research report, please select the type of document that fits best your needs.Attachement Size(s):
MPI-I-2004-1-001.ps490 KBytes
Please note: If you don't have a viewer for PostScript on your platform, try to install GhostScript and GhostView
URL to this document:
Hide details for BibTeXBibTeX
  AUTHOR = {Beldiceanu, Nicolas and Katriel, Irit and Thiel, Sven},
  TITLE = {Filtering algorithms for the {S}ame and {U}sed{B}y constraints},
  TYPE = {Research Report},
  INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
  ADDRESS = {Stuhlsatzenhausweg 85, 66123 Saarbr{\"u}cken, Germany},
  NUMBER = {MPI-I-2004-1-001},
  MONTH = {February},
  YEAR = {2004},
  ISSN = {0946-011X},