Beldiceanu, Nicolas and Carlsson, Mats (2001) Constructive Cardinality. [SICS Report]
![[img]](/style/images/fileicons/application_postscript.png) | Postscript 70Kb | |
![[img]](/style/images/fileicons/application_pdf.png)
| PDF 43Kb |
Abstract
We describe a set of necessary conditions that are useful for generating propagation algorithms for the cardinality operator as well as for over-constrained problems with preferences. Constructive disjunction as well as the entailments rules originally proposed for the cardinality operator can be seen as simple cases of these necessary conditions. In addition these necessary conditions have the advantage of providing more pruning.
| Item Type: | SICS Report |
|---|---|
| Uncontrolled Keywords: | Combinatorial problems, cardinality constraint, constructive disjunction, soft constraints |
| ID Code: | 2389 |
| Deposited By: | Vicki Carleson |
| Deposited On: | 30 Jul 2009 |
| Last Modified: | 18 Nov 2009 16:08 |
Repository Staff Only: item control page
