- Origin
Derived from and from .
- Constraint
-
- Types
| |
| |
- Arguments
| |
| |
- Restrictions
-
- Purpose
Given a collection of sets,
each containing the same number of domain variables,
the constraint enforces a
constraint between each pair of consecutive sets.
- Example
-
The first argument of the constraint
corresponds to 3 collections of variables, while
the second argument defines the 3 sets of values
, and .
The constraint holds since:
The first and second collections of variables are assigned 3 values in the
as well as 3 values in .
The second and third collections of variables are also assigned 3 values in the
as well as 3 values in .
- Typical
-
- Symmetries
Items of are permutable.
Items of are permutable.
Items of are permutable.
Items of are permutable.
An occurrence of a value of can be replaced by any other value that also belongs to the same partition of .
- See also
common keyword:
Β (system of constraints).
implies:
.
part of system of constraints:
.
used in graph description:
.
- Keywords
characteristic of a constraint:
partition.
combinatorial object:
permutation.
constraint type:
system of constraints,
decomposition.