5.210. k_same_partition
DESCRIPTION | LINKS | GRAPH |
- Origin
- Constraint
- Types
- Arguments
- Restrictions
- Purpose
Given a collection of sets, each containing the same number of domain variables, the constraint forces 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 .
- Arg. properties
Contractible wrt. .
- See also
common keyword: Β (system of constraints).
implies: .
- Keywords
characteristic of a constraint: sort based reformulation, partition.
- Arc input(s)
- Arc generator
-
- Arc arity
- Arc constraint(s)
- Graph property(ies)
-
- Graph model
PartsΒ (A) andΒ (B) of FigureΒ 5.210.1 respectively show the initial and final graph associated with the Example slot. To each vertex corresponds a collection of variables, while to each arc corresponds a constraint.
Figure 5.210.1. Initial and final graph of the constraint
(a) (b)