- Origin
N.Β Beldiceanu
- Constraint
-
- Arguments
| |
| |
| |
- Restrictions
|
|
|
|
- Purpose
Let us note the variables of the
collection.
is the period of the sequence
according to constraint . This means that
is the smallest natural number such that
holds for all .
- Example
-
The constraint holds since, as depicted by
FigureΒ 5.319.1, its first argument is equal
(i.e.,Β since is set to ) to the period of
the sequence .
- Typical
|
|
|
|
|
- Symmetries
Items of can be reversed.
Items of can be shifted.
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
-
- Algorithm
When corresponds to the equality constraint,
a potentially incomplete filtering algorithm based on
13 deductions rules is described inΒ [BeldiceanuPoder04].
The generalisation of these rules to the case where
is not the equality constraint is discussed.
- See also
generalisation:
Β ( replaced by vector).
implies:
.
soft variant:
Β (value 0 can match any other value).
- Keywords
combinatorial object:
periodic,
sequence.
constraint arguments:
pure functional dependency.
constraint type:
predefined constraint,
timetabling constraint,
scheduling constraint.
filtering:
border.
modelling:
functional dependency.