5.379. strictly_decreasing
| DESCRIPTION | LINKS | GRAPH | AUTOMATON |
- Origin
- Constraint
- Argument
- Restriction
- Purpose
The variables of the collection are strictly decreasing.
- Example
-
The constraint holds since .
- Typical
- Symmetry
One and the same constant can be added to the attribute of all items of .
- Arg. properties
Contractible wrt. .
- Counting
-
Length () 2 3 4 5 6 7 8 9 10 Solutions 3 4 5 6 7 8 9 10 11 Number of solutions for : domains
- Systems
increasingNValue in Choco, rel in Gecode.
- See also
common keyword: Β (order constraint).
implies: , .
- Keywords
characteristic of a constraint: automaton, automaton without counters, reified automaton constraint.
constraint network structure: sliding cyclic(1) constraint network(1).
- Arc input(s)
- Arc generator
-
- Arc arity
- Arc constraint(s)
- Graph property(ies)
-
- Graph model
PartsΒ (A) andΒ (B) of FigureΒ 5.379.1 respectively show the initial and final graph associated with the Example slot. Since we use the graph property, the arcs of the final graph are stressed in bold.
Figure 5.379.1. Initial and final graph of the constraint
(a) (b)
- Automaton
FigureΒ 5.379.2 depicts the automaton associated with the constraint. To each pair of consecutive variables of the collection corresponds a 0-1 signature variable . The following signature constraint links , and : .
Figure 5.379.2. Automaton of the constraint
Figure 5.379.3. Hypergraph of the reformulation corresponding to the automaton of the constraint
