- Origin
Derived from .
- Constraint
-
- Type
| |
- Arguments
| |
| |
| |
- Restrictions
-
- Purpose
is the maximum number of time that values of a same
partition of are taken by the variables of the
collection .
- Example
-
In this example, two variables of the collection
are assigned values of the first partition, no variable is assigned a
value of the second partition, and finally two variables are assigned values
of the last partition.
As a consequence, the constraint
holds since its first argument is assigned to the maximum number of
occurrences 2.
- Typical
|
|
|
|
- Symmetries
Items of are permutable.
Items of are permutable.
Items of are permutable.
- Arg. properties
Functional dependency: determined by and .
- See also
generalisation:
Β (single replaced by an individual for each value and replaced by ).
used in graph description:
.
- Keywords
characteristic of a constraint:
partition.
constraint arguments:
pure functional dependency.
constraint type:
value constraint.
filtering:
arc-consistency.
final graph structure:
acyclic,
bipartite,
no loop.
modelling:
at most,
functional dependency.
