- Origin
Derived from
- Constraint
-
- Types
| |
| |
- Arguments
| |
| |
| |
- Restrictions
-
- Purpose
Let us note
the vectors of the collection, and the number of components of each vector
(all vectors have the same size).
is the number of times that the following disjunctions holds where
Β Β Β Β Β
Β Β Β Β Β
Β Β Β Β Β
Β Β Β Β Β .
- Example
-
In the example we have the following 3 changes:
One change between and since ,
One change between and since ,
One change between and since .
Consequently the constraint holds
since its first argument is assigned value 3.
- Typical
|
|
|
|
- Arg. properties
Functional dependency: determined by and .
- See also
specialisation:
Β (vector replaced by ),
Β (vector replaced by of ).
- Keywords
characteristic of a constraint:
automaton,
automaton with counters,
vector.
constraint arguments:
pure functional dependency.
constraint network structure:
Berge-acyclic constraint network.
modelling:
number of changes,
functional dependency.