You are required to read and agree to the below before accessing a full-text version of an article in the IDE article repository.

The full-text document you are about to access is subject to national and international copyright laws. In most cases (but not necessarily all) the consequence is that personal use is allowed given that the copyright owner is duly acknowledged and respected. All other use (typically) require an explicit permission (often in writing) by the copyright owner.

For the reports in this repository we specifically note that

  • the use of articles under IEEE copyright is governed by the IEEE copyright policy (available at http://www.ieee.org/web/publications/rights/copyrightpolicy.html)
  • the use of articles under ACM copyright is governed by the ACM copyright policy (available at http://www.acm.org/pubs/copyright_policy/)
  • technical reports and other articles issued by M‰lardalen University is free for personal use. For other use, the explicit consent of the authors is required
  • in other cases, please contact the copyright owner for detailed information

By accepting I agree to acknowledge and respect the rights of the copyright owner of the document I am about to access.

If you are in doubt, feel free to contact webmaster@ide.mdh.se

Filtering Methods for Symmetric Cardinality Constraint

Authors:

Waldemar Kocjan

Note:

Available at http://www.springerlink.com/index/DBWMD10GWK5LNCM2.pdf

Publication Type:

Conference/Workshop Paper

Venue:

CPAIOR 2004 Conference Proceedings

Publisher:

Springer

Abstract

The symmetric cardinality constraint is described in terms of a set of variables X={x1,...,xk}, which take their values as subsets of values V={v1,...,vn}. It constraints the cardinality of the set assigned to each variable to be in an interval [lxi,cxi] and at the same time it restricts the number of occurrences of each value vj in V in the sets assigned to variables in X to be in an other interval [lvj,cvj]. In this paper we introduce the symmetric cardinality constraint and define set constraint satisfaction problem as a framework for dealing with this type of constraints. Moreover, we present effective filtering methods for the symmetric cardinality constraint.

Bibtex

@inproceedings{Kocjan678,
author = {Waldemar Kocjan},
title = {Filtering Methods for Symmetric Cardinality Constraint},
note = {Available at http://www.springerlink.com/index/DBWMD10GWK5LNCM2.pdf},
editor = {Jean-Charles Regin and Michel Rueher},
pages = {200--208},
month = {April},
year = {2004},
booktitle = {CPAIOR 2004 Conference Proceedings},
publisher = {Springer},
url = {http://www.es.mdu.se/publications/678-}
}