5.40. atmost1
DESCRIPTION | LINKS |
- Origin
- Constraint
- Synonym
.
- Argument
- Restrictions
- Purpose
Given a collection of set variables and their respective cardinality , the constraint forces the following two conditions:
,
.
- Example
-
The constraint holds since:
, , , .
, , ,
, ,
.
- Typical
- Symmetries
Items of are permutable.
All occurrences of two distinct values of can be swapped; all occurrences of a value of can be renamed to any unused value.
- Arg. properties
Contractible wrt. .
- Remark
When we have only two set variables the constraint was called inΒ [HoeveSabharwal07].
- Algorithm
C. Bessière et al. have shown in [BessiereHebrardHnichWalsh04] that it is NP-hard to enforce bound consistency for the constraint. Consequently, following the first filtering algorithm from A. Sadler and C. Gervet [SadlerGervet01], W.-J. van Hoeve and A. Sabharwal have proposed an algorithm that enforces bound-consistency when the constraint involves only two sets variables [HoeveSabharwal07].
- Systems
- Keywords
constraint arguments: constraint involving set variables.