Change search
ReferencesLink to record
Permanent link

Direct link
Constructive Cardinality
Number of Authors: 2
2001 (English)Report (Refereed)
Abstract [en]

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.
Series
SICS Technical Report, ISSN 1100-3154 ; 2001:15
Keyword [en]
Combinatorial problems, cardinality constraint, constructive disjunction, soft constraints
National Category
Computer and Information Science
Identifiers
URN: urn:nbn:se:ri:diva-22111OAI: oai:DiVA.org:ri-22111DiVA: diva2:1041653
Available from: 2016-10-31 Created: 2016-10-31

Open Access in DiVA

fulltext(43 kB)4 downloads
File information
File name FULLTEXT01.pdfFile size 43 kBChecksum SHA-512
cafbe66c6408f1d56f6a743d32131fd59fc1691bec168358164d48332a91f06b4522381452768e6825d5ff4fc15611f9e97a52128f55e0c97ff51afb89948a1f
Type fulltextMimetype application/pdf

Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 4 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 3 hits
ReferencesLink to record
Permanent link

Direct link