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

Symmetric Cardinality Constraints

Fulltext:


Authors:

Waldemar Kocjan

Research group:

Programming Languages

Publication Type:

Licentiate Thesis

Abstract

This thesis contains previously published papers concerning different aspects of symmetric cardinality constraints. A symmetric cardinality constraint generalizes cardinality constraints like constraint of difference and global cardinality constraint. The algorithms formulating the basis for consistency checking and filtering of a symmetric cardinality constraint can be successfully used to model and solve several other problems like cardinality matrix problems, Latin square problems and rostering problems. This thesis begins with an introduction to constraint satisfaction and describe several problems, mainly dynamic scheduling problems, which can be modeled using this framework. The two following papers introduce symmetric cardinality constraint and its weighted version. They also provide methods for computing their consistency and algorithms for filtering their domains. Finally, the last paper describes methods for maintaining consistency of a symmetric cardinality constraint with costs, in the context of dynamic constraint satisfaction.

Bibtex

@misc{Kocjan907,
author = {Waldemar Kocjan},
title = {Symmetric Cardinality Constraints},
number = {59},
month = {December},
year = {2005},
url = {http://www.es.mdu.se/publications/907-}
}