Global Constraint Catalog

2.3.2.2. Elementary constraints attached to the arcs

This section describes the constraints that are associated with the arcs of the initial graph of a global constraint. These constraints are called arc constraints. To each arc one can associate one or several arc constraints. An arc will belong to the final graph if and only if all its arc constraints hold. An arc constraint from a vertex $v_{1}$ to a vertex $v_{2}$ mentions variables and/or values associated with $v_{1}$ and $v_{2}$ . Before defining an arc constraint, we first need to introduce simple arithmetic expressions as well as arithmetic expressions. Simple arithmetic expressions and arithmetic expressions are defined recursively.

Simple arithmetic expressions

A simple arithmetic expression is defined by one of the five following expressions.

$I$ : $I$ is an integer.
$𝙰𝚛𝚐$ : $𝙰𝚛𝚐$ is an argument of the global constraint of type $𝚒𝚗𝚝$ or $𝚍𝚟𝚊𝚛$ .
$𝙰𝚛𝚐$ : $𝙰𝚛𝚐$ is a formal parameter provided by the arc generatorArc generators are described in Section 2.3.2.3 on page 2.3.2.3. of the graph-constraint.
$𝙲𝚘𝚕 . 𝙰𝚝𝚝𝚛$ : $𝙲𝚘𝚕$ is a formal parameter provided by the arc generator or the collection used in the $𝙵𝚘𝚛 𝚊𝚕𝚕 𝚒𝚝𝚎𝚖𝚜 𝚘𝚏$ iterator.The $𝙵𝚘𝚛 𝚊𝚕𝚕 𝚒𝚝𝚎𝚖𝚜 𝚘𝚏$ iterator is described in Section 2.3.3.1 on page 2.3.3.1. $𝙰𝚝𝚝𝚛$ is an attribute of the collection referenced by $𝙲𝚘𝚕$ .
EXAMPLE: As an example consider the first graph-constraint associated with the $𝚐𝚕𝚘𝚋𝚊𝚕_𝚌𝚊𝚛𝚍𝚒𝚗𝚊𝚕𝚒𝚝𝚢_𝚠𝚒𝚝𝚑_𝚌𝚘𝚜𝚝𝚜$ $(𝚅𝙰𝚁𝙸𝙰𝙱𝙻𝙴𝚂, 𝚅𝙰𝙻𝚄𝙴𝚂, 𝙼𝙰𝚃𝚁𝙸𝚇, 𝙲𝙾𝚂𝚃)$ constraint and its arc constraint $𝚟𝚊𝚛𝚒𝚊𝚋𝚕𝚎𝚜 . 𝚟𝚊𝚛$ $= 𝚅𝙰𝙻𝚄𝙴𝚂 . 𝚟𝚊𝚕$ . Both, $𝚟𝚊𝚛𝚒𝚊𝚋𝚕𝚎𝚜 . 𝚟𝚊𝚛$ as well as $𝚅𝙰𝙻𝚄𝙴𝚂 . 𝚟𝚊𝚕$ are simple arithmetic expressions of the form $𝙲𝚘𝚕 . 𝙰𝚝𝚝𝚛$ :
- In $𝚟𝚊𝚛𝚒𝚊𝚋𝚕𝚎𝚜 . 𝚟𝚊𝚛$ , $𝚟𝚊𝚛𝚒𝚊𝚋𝚕𝚎𝚜$ corresponds to the formal parameter provided by the arc generator $𝑆𝐸𝐿𝐹 \mapsto 𝚌𝚘𝚕𝚕𝚎𝚌𝚝𝚒𝚘𝚗 (𝚟𝚊𝚛𝚒𝚊𝚋𝚕𝚎𝚜)$ , while $𝚟𝚊𝚛$ is an attribute of the $𝚅𝙰𝚁𝙸𝙰𝙱𝙻𝙴𝚂$ collection.
- In $𝚅𝙰𝙻𝚄𝙴𝚂 . 𝚟𝚊𝚕$ , $𝚅𝙰𝙻𝚄𝙴𝚂$ corresponds to the collection denoted by the $𝙵𝚘𝚛$ $𝚊𝚕𝚕 𝚒𝚝𝚎𝚖𝚜 𝚘𝚏$ iterator, while $𝚟𝚊𝚕$ is an attribute of the $𝚅𝙰𝙻𝚄𝙴𝚂$ collection.
$𝙲𝚘𝚕 [𝙴𝚡𝚙𝚛] . 𝙰𝚝𝚝𝚛$ : $𝙲𝚘𝚕$ is an argument of type $𝚌𝚘𝚕𝚕𝚎𝚌𝚝𝚒𝚘𝚗$ , $𝙰𝚝𝚝𝚛$ one attribute of $𝙲𝚘𝚕$ and $𝙴𝚡𝚙𝚛$ an arithmetic expression.

$𝙲𝚘𝚕 [𝙴𝚡𝚙𝚛] . 𝙰𝚝𝚝𝚛$ denotes the value of attribute $𝙰𝚝𝚝𝚛$ of the ${𝙴𝚡𝚙𝚛}^{t h}$ item of the collection denoted by $𝙲𝚘𝚕$ .
EXAMPLE: As an example consider the $𝚐𝚕𝚘𝚋𝚊𝚕_𝚌𝚊𝚛𝚍𝚒𝚗𝚊𝚕𝚒𝚝𝚢_𝚠𝚒𝚝𝚑_𝚌𝚘𝚜𝚝𝚜$ $($ $𝚅𝙰𝚁𝙸𝙰𝙱𝙻𝙴𝚂, 𝚅𝙰𝙻𝚄𝙴𝚂, 𝙼𝙰𝚃𝚁𝙸𝚇, 𝙲𝙾𝚂𝚃)$ constraint and its second graph-constraint, which defines the $𝙲𝙾𝚂𝚃$ variable. The expression $𝙼𝙰𝚃𝚁𝙸𝚇 [(𝚟𝚊𝚛𝚒𝚊𝚋𝚕𝚎𝚜 . 𝚔𝚎𝚢 - 1) * | 𝚅𝙰𝙻𝚄𝙴𝚂 | +$ $𝚟𝚊𝚕𝚞𝚎𝚜 . 𝚔𝚎𝚢] . 𝚌$ is a simple arithmetic expression of the form $𝙲𝚘𝚕 [𝙴𝚡𝚙𝚛] . 𝙰𝚝𝚝𝚛$ :
- $𝙼𝙰𝚃𝚁𝙸𝚇$ is a collection of items $𝚌𝚘𝚕𝚕𝚎𝚌𝚝𝚒𝚘𝚗 (𝚒 - 𝚒𝚗𝚝, 𝚓 - 𝚒𝚗𝚝, 𝚌 - 𝚒𝚗𝚝)$ where all items are sorted in increasing order on attributes $𝚒, 𝚓$ (because of the restriction $𝚒𝚗𝚌𝚛𝚎𝚊𝚜𝚒𝚗𝚐_𝚜𝚎𝚚 (𝙼𝙰𝚃𝚁𝙸𝚇, [𝚒, 𝚓])$ ).
- $𝙼𝙰𝚃𝚁𝙸𝚇 [(𝚟𝚊𝚛𝚒𝚊𝚋𝚕𝚎𝚜 . 𝚔𝚎𝚢 - 1) * | 𝚅𝙰𝙻𝚄𝙴𝚂 | + 𝚟𝚊𝚕𝚞𝚎𝚜 . 𝚔𝚎𝚢] . 𝚌$ denotes the value of attribute $𝚌$ of an item of the $𝙼𝙰𝚃𝚁𝙸𝚇$ collection. The position of this item within the $𝙼𝙰𝚃𝚁𝙸𝚇$ collection depends on the position of a variable of the $𝚅𝙰𝚁𝙸𝙰𝙱𝙻𝙴𝚂$ collectionThis position is denoted by the expression $𝚟𝚊𝚛𝚒𝚊𝚋𝚕𝚎𝚜 . 𝚔𝚎𝚢$ . As defined in Section 2.2.2 on page 2.2.2, $𝚔𝚎𝚢$ is an implicit attribute corresponding to the position of an item within a collection. as well as on the position of a value of the $𝚅𝙰𝙻𝚄𝙴𝚂$ collection.This position is denoted by the expression $𝚟𝚊𝚕𝚞𝚎𝚜 . 𝚔𝚎𝚢$ .

Arithmetic expressions

An arithmetic expression is recursively defined by one of the following expressions:

A simple arithmetic expression.
𝙴𝚡𝚙 1 𝙾𝚙 𝙴𝚡𝚙 2
- ${𝙴𝚡𝚙}_{1}$ is an arithmetic expression,
- $𝙾𝚙$ is one of the following symbols $+$ , $-$ , $*$ , $/$ $/$ denotes an integer division, a division in which the fractional part is discarded.,
- ${𝙴𝚡𝚙}_{2}$ is an arithmetic expression.
|𝙲𝚘𝚕𝚕𝚎𝚌𝚝𝚒𝚘𝚗|
- $𝙲𝚘𝚕𝚕𝚎𝚌𝚝𝚒𝚘𝚗$ is an argument of type $𝚌𝚘𝚕𝚕𝚎𝚌𝚝𝚒𝚘𝚗$ and $| 𝙲𝚘𝚕𝚕𝚎𝚌𝚝𝚒𝚘𝚗 |$ denotes the number of items of that collection.
|𝙴𝚡𝚙|
- $𝙴𝚡𝚙$ is an arithmetic expression, and $| 𝙴𝚡𝚙 |$ denotes the absolute value of this expression.
$𝚜𝚒𝚐𝚗 (𝙴𝚡𝚙)$
- $𝙴𝚡𝚙$ is an arithmetic expression, and $𝚜𝚒𝚐𝚗 (𝙴𝚡𝚙)$ the sign of $𝙴𝚡𝚙$ ( $- 1$ if $𝙴𝚡𝚙$ is negative, 0 if $𝙴𝚡𝚙$ is equal to 0, 1 if $𝙴𝚡𝚙$ is positive).
EXAMPLE: An example of use of $𝚜𝚒𝚐𝚗$ can be found in the last part of the arc constraint of the $𝚌𝚛𝚘𝚜𝚜𝚒𝚗𝚐$ constraint:

$𝚜𝚒𝚐𝚗 ((𝚜 2 . 𝚘𝚡 - 𝚜 1 . 𝚎𝚡) * (𝚜 1 . 𝚎𝚢 - 𝚜 1 . 𝚘𝚢) - (𝚜 1 . 𝚎𝚡 - 𝚜 1 . 𝚘𝚡) * (𝚜 2 . 𝚘𝚢 - 𝚜 1 . 𝚎𝚢)) \neq$

$𝚜𝚒𝚐𝚗 ((𝚜 2 . 𝚎𝚡 - 𝚜 1 . 𝚎𝚡) * (𝚜 2 . 𝚘𝚢 - 𝚜 1 . 𝚘𝚢) - (𝚜 2 . 𝚘𝚡 - 𝚜 1 . 𝚘𝚡) * (𝚜 2 . 𝚎𝚢 - 𝚜 1 . 𝚎𝚢))$
$𝚌𝚊𝚛𝚍_𝚜𝚎𝚝 (𝚂𝚎𝚝)$ :
- $𝚂𝚎𝚝$ is a reference to a set of integers or to a set variable. $𝚌𝚊𝚛𝚍_𝚜𝚎𝚝 (𝚂𝚎𝚝)$ denotes the number of elements of that set.
EXAMPLE: An example of use of $𝚌𝚊𝚛𝚍_𝚜𝚎𝚝$ can be found in the $𝚜𝚢𝚖𝚖𝚎𝚝𝚛𝚒𝚌_𝚐𝚌𝚌$ constraint: $𝚟𝚊𝚛𝚜 . 𝚗𝚘𝚌𝚌 = 𝚌𝚊𝚛𝚍_𝚜𝚎𝚝 (𝚟𝚊𝚛𝚜 . 𝚟𝚊𝚛)$ .
𝚂𝚒𝚖𝚙𝚕𝚎𝙴𝚡𝚙 1 mod 𝚂𝚒𝚖𝚙𝚕𝚎𝙴𝚡𝚙 2 ,
$min ({𝚂𝚒𝚖𝚙𝚕𝚎𝙴𝚡𝚙}_{1}, {𝚂𝚒𝚖𝚙𝚕𝚎𝙴𝚡𝚙}_{2})$ or $max ({𝚂𝚒𝚖𝚙𝚕𝚎𝙴𝚡𝚙}_{1}, {𝚂𝚒𝚖𝚙𝚕𝚎𝙴𝚡𝚙}_{2})$
- ${𝚂𝚒𝚖𝚙𝚕𝚎𝙴𝚡𝚙}_{1}$ is a simple arithmetic expression,
- ${𝚂𝚒𝚖𝚙𝚕𝚎𝙴𝚡𝚙}_{2}$ is a simple arithmetic expression.

Arc constraints

Now that we have introduced simple arithmetic expressions as well as arithmetic expressions we define an arc constraint. An arc constraint is recursively defined by one of the following expressions:

$𝚃𝚁𝚄𝙴$

This stands for an arc constraint that always holds. As a result, the corresponding arc always belongs to the final graph.

EXAMPLE: An example of use of $𝚃𝚁𝚄𝙴$ can be found in the $𝚜𝚞𝚖_𝚌𝚝𝚛$ $(𝚅𝙰𝚁𝙸𝙰𝙱𝙻𝙴𝚂,$ $𝙲𝚃𝚁,$ $𝚅𝙰𝚁)$ constraint, where it is used in order to enforce keeping all items of the $𝚅𝙰𝚁𝙸𝙰𝙱𝙻𝙴𝚂$ collection in the final graph.
𝙴𝚡𝚙 1 𝙲𝚘𝚖𝚙𝚊𝚛𝚒𝚜𝚘𝚗 𝙴𝚡𝚙 2
- ${𝙴𝚡𝚙}_{1}$ is an arithmetic expression,
- $𝙲𝚘𝚖𝚙𝚊𝚛𝚒𝚜𝚘𝚗$ is one of the comparison operators $\leq$ , $\geq$ , $<$ , $>$ , $=$ , $\neq$ ,
- ${𝙴𝚡𝚙}_{2}$ is an arithmetic expression.
EXAMPLE: As an example of such arc constraint, the second graph-constraint of the $𝚌𝚞𝚖𝚞𝚕𝚊𝚝𝚒𝚟𝚎$ $(𝚃𝙰𝚂𝙺𝚂, 𝙻𝙸𝙼𝙸𝚃)$ constraint uses the following arc constraints:
- $𝚝𝚊𝚜𝚔𝚜 1 . 𝚍𝚞𝚛𝚊𝚝𝚒𝚘𝚗 > 0$ ,
- $𝚝𝚊𝚜𝚔𝚜 2 . 𝚘𝚛𝚒𝚐𝚒𝚗 \leq 𝚝𝚊𝚜𝚔𝚜 1 . 𝚘𝚛𝚒𝚐𝚒𝚗$ ,
- $𝚝𝚊𝚜𝚔𝚜 1 . 𝚘𝚛𝚒𝚐𝚒𝚗 < 𝚝𝚊𝚜𝚔𝚜 2 . 𝚎𝚗𝚍$ .
The conjunction of these three arc constraints can be interpreted in the following way: an arc from a task $𝚝𝚊𝚜𝚔𝚜 1$ to a task $𝚝𝚊𝚜𝚔𝚜 2$ will belong to the final graph if and only if $𝚝𝚊𝚜𝚔𝚜 2$ overlaps the origin of $𝚝𝚊𝚜𝚔𝚜 1$ .
𝙴𝚡𝚙 1 𝚂𝚒𝚖𝚙𝚕𝚎𝙲𝚝𝚛 𝙴𝚡𝚙 2
- ${𝙴𝚡𝚙}_{1}$ is an arithmetic expression,
- $𝚂𝚒𝚖𝚙𝚕𝚎𝙲𝚝𝚛$ is an argument of type $𝚊𝚝𝚘𝚖$ that can only take one of the values $\leq$ , $\geq$ , $<$ , $>$ , $=$ , $\neq$ ,
- ${𝙴𝚡𝚙}_{2}$ is an arithmetic expression.
EXAMPLE: An example of use of such an arc constraint can be found in the $𝚌𝚑𝚊𝚗𝚐𝚎$ $(𝙽𝙲𝙷𝙰𝙽𝙶𝙴, 𝚅𝙰𝚁𝙸𝙰𝙱𝙻𝙴𝚂, 𝙲𝚃𝚁)$ constraint: $𝚟𝚊𝚛𝚒𝚊𝚋𝚕𝚎𝚜 1 . 𝚟𝚊𝚛$ $𝙲𝚃𝚁$ $𝚟𝚊𝚛𝚒𝚊𝚋𝚕𝚎𝚜 2 . 𝚟𝚊𝚛$ . Within this expression, $𝚟𝚊𝚛𝚒𝚊𝚋𝚕𝚎𝚜 1$ and $𝚟𝚊𝚛𝚒𝚊𝚋𝚕𝚎𝚜 2$ correspond to consecutive items of the $𝚅𝙰𝚁𝙸𝙰𝙱𝙻𝙴𝚂$ collection.
𝙴𝚡𝚙 1 ¬𝚂𝚒𝚖𝚙𝚕𝚎𝙲𝚝𝚛 𝙴𝚡𝚙 2
- ${𝙴𝚡𝚙}_{1}$ is an arithmetic expression,
- $𝚂𝚒𝚖𝚙𝚕𝚎𝙲𝚝𝚛$ is an argument of type $𝚊𝚝𝚘𝚖$ that can only take one of the values $\leq$ , $\geq$ , $<$ , $>$ , $=$ , $\neq$ ,
- ${𝙴𝚡𝚙}_{2}$ is an arithmetic expression.
EXAMPLE: An example of use of such an arc constraint can be found in the $𝚌𝚑𝚊𝚗𝚐𝚎_𝚌𝚘𝚗𝚝𝚒𝚗𝚞𝚒𝚝𝚢$ $(𝙽𝙱_𝙿𝙴𝚁𝙸𝙾𝙳_𝙲𝙷𝙰𝙽𝙶𝙴,$ $𝙽𝙱_𝙿𝙴𝚁𝙸𝙾𝙳_𝙲𝙾𝙽𝚃𝙸𝙽𝚄𝙸𝚃𝚈,$ $𝙼𝙸𝙽_𝚂𝙸𝚉𝙴_𝙲𝙷𝙰𝙽𝙶𝙴,$ $𝙼𝙰𝚇_𝚂𝙸𝚉𝙴_𝙲𝙷𝙰𝙽𝙶𝙴,$ $𝙼𝙸𝙽_𝚂𝙸𝚉𝙴_𝙲𝙾𝙽𝚃𝙸𝙽𝚄𝙸𝚃𝚈,$ $𝙼𝙰𝚇_𝚂𝙸𝚉𝙴_𝙲𝙾𝙽𝚃𝙸𝙽𝚄𝙸𝚃𝚈,$ $𝙽𝙱_𝙲𝙷𝙰𝙽𝙶𝙴,$ $𝙽𝙱_𝙲𝙾𝙽𝚃𝙸𝙽𝚄𝙸𝚃𝚈,$ $𝚅𝙰𝚁𝙸𝙰𝙱𝙻𝙴𝚂,$ $𝙲𝚃𝚁)$ constraint: $𝚟𝚊𝚛𝚒𝚊𝚋𝚕𝚎𝚜 1 . 𝚟𝚊𝚛$ $\neg 𝙲𝚃𝚁$ $𝚟𝚊𝚛𝚒𝚊𝚋𝚕𝚎𝚜 2 . 𝚟𝚊𝚛$ . Within this expression, $𝚟𝚊𝚛𝚒𝚊𝚋𝚕𝚎𝚜 1$ and $𝚟𝚊𝚛𝚒𝚊𝚋𝚕𝚎𝚜 2$ correspond to consecutive items of the $𝚅𝙰𝚁𝙸𝙰𝙱𝙻𝙴𝚂$ collection.
𝚌𝚘𝚗𝚜𝚝𝚛𝚊𝚒𝚗𝚝(𝙴𝚡𝚙 1 ,⋯,𝙴𝚡𝚙 n )
- $𝚌𝚘𝚗𝚜𝚝𝚛𝚊𝚒𝚗𝚝$ is a global constraint defined in the catalogue for which there exists a graph-based and/or an automaton-based representation,
- ${𝙴𝚡𝚙}_{1}, \dots, {𝙴𝚡𝚙}_{n}$ correspond to the arguments of the global constraint $𝚌𝚘𝚗𝚜𝚝𝚛𝚊𝚒𝚗𝚝$ . Each argument should be a simple arithmetic expression that is compatible with the type declaration of the argument of $𝚌𝚘𝚗𝚜𝚝𝚛𝚊𝚒𝚗𝚝$ .
EXAMPLE: An example of such arc constraint can be found in the definition of $𝚍𝚒𝚏𝚏𝚗$ : $𝚍𝚒𝚏𝚏𝚗$ $(𝙾𝚁𝚃𝙷𝙾𝚃𝙾𝙿𝙴𝚂)$ uses the $𝚝𝚠𝚘_𝚘𝚛𝚝𝚑_𝚍𝚘_𝚗𝚘𝚝_𝚘𝚟𝚎𝚛𝚕𝚊𝚙$ $(𝙾𝚁𝚃𝙷𝙾𝚃𝙾𝙿𝙴 1,$ $𝙾𝚁𝚃𝙷𝙾𝚃𝙾𝙿𝙴 2)$ global constraint for defining its arc constraint. Since $𝙾𝚁𝚃𝙷𝙾𝚃𝙾𝙿𝙴𝚂$ is a collection of type $𝚌𝚘𝚕𝚕𝚎𝚌𝚝𝚒𝚘𝚗$ $(𝚘𝚛𝚒 - 𝚍𝚟𝚊𝚛,$ $𝚜𝚒𝚣 - 𝚍𝚟𝚊𝚛,$ $𝚎𝚗𝚍 - 𝚍𝚟𝚊𝚛)$ and since both $𝙾𝚁𝚃𝙷𝙾𝚃𝙾𝙿𝙴 1$ and $𝙾𝚁𝚃𝙷𝙾𝚃𝙾𝙿𝙴 2$ correspond to items of $𝙾𝚁𝚃𝙷𝙾𝚃𝙾𝙿𝙴𝚂$ there is no type compatibility problem between the call to $𝚝𝚠𝚘_𝚘𝚛𝚝𝚑_𝚍𝚘_𝚗𝚘𝚝_𝚘𝚟𝚎𝚛𝚕𝚊𝚙$ and its definition.
𝙰𝚛𝚌𝙲𝚝𝚛 1 𝙻𝚘𝚐𝚒𝚌𝚊𝚕𝙲𝚘𝚗𝚗𝚎𝚌𝚝𝚘𝚛 𝙰𝚛𝚌𝙲𝚝𝚛 2
- ${𝙰𝚛𝚌𝙲𝚝𝚛}_{1}$ is an arc constraint,
- $𝙻𝚘𝚐𝚒𝚌𝚊𝚕𝙲𝚘𝚗𝚗𝚎𝚌𝚝𝚘𝚛$ is one of the logical connectors $\lor$ , $\land$ , $\Rightarrow$ , $\Leftrightarrow$ ,
- ${𝙰𝚛𝚌𝙲𝚝𝚛}_{2}$ is an arc constraint.
EXAMPLE: As shown by the following example, $𝚖𝚒𝚗𝚒𝚖𝚞𝚖$ $(𝙼𝙸𝙽, 𝚅𝙰𝚁𝙸𝙰𝙱𝙻𝙴𝚂)$ uses this kind of arc constraint: $𝚟𝚊𝚛𝚒𝚊𝚋𝚕𝚎𝚜 1 = 𝚟𝚊𝚛𝚒𝚊𝚋𝚕𝚎𝚜 2 \lor 𝚟𝚊𝚛𝚒𝚊𝚋𝚕𝚎𝚜 1 . 𝚟𝚊𝚛 < 𝚟𝚊𝚛𝚒𝚊𝚋𝚕𝚎𝚜 2 . 𝚟𝚊𝚛$ , where $𝚟𝚊𝚛𝚒𝚊𝚋𝚕𝚎𝚜 1$ and $𝚟𝚊𝚛𝚒𝚊𝚋𝚕𝚎𝚜 2$ correspond to items of the $𝚅𝙰𝚁𝙸𝙰𝙱𝙻𝙴𝚂$ collection, holds if and only if one of the following conditions holds:
- $𝚟𝚊𝚛𝚒𝚊𝚋𝚕𝚎𝚜 1$ and $𝚟𝚊𝚛𝚒𝚊𝚋𝚕𝚎𝚜 2$ correspond to the same item of the $𝚅𝙰𝚁𝙸𝙰𝙱𝙻𝙴𝚂$ collection,
- The $𝚟𝚊𝚛$ attribute of $𝚟𝚊𝚛𝚒𝚊𝚋𝚕𝚎𝚜 1$ is strictly less than the $𝚟𝚊𝚛$ attribute of $𝚟𝚊𝚛𝚒𝚊𝚋𝚕𝚎𝚜 2$ .

Global Constraint Catalog

2. Describing Global Constraints

2.3.2.2. Elementary constraints attached to the arcs

Simple arithmetic expressions

Arithmetic expressions

Arc constraints