Number of Authors: 2
2001 (English)Report (Refereed)
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.
Place, publisher, year, edition, pages
Kista, Sweden: Swedish Institute of Computer Science , 2001, 1. , 5 p.
SICS Technical Report, ISSN 1100-3154 ; 2001:15
Combinatorial problems, cardinality constraint, constructive disjunction, soft constraints
Computer and Information Science
IdentifiersURN: urn:nbn:se:ri:diva-14299OAI: oai:DiVA.org:ri-14299DiVA: diva2:1035587