### 2.1.6. Reification view

Suppose we want to associate a 0-1 domain variable $b$ to a constraint $𝒞$ and maintain the equivalence $b\equiv 𝒞$. This is called the reification of $𝒞$. For most global constraints this can be achieved by reformulating the global constraint as a conjunction of pure functional dependency constraints together with constraints that can be easily reified, e.g. linear constraints involving at most two variables [BeldiceanuCarlssonFlenerPearson13].

We can reify the $\mathrm{𝚊𝚕𝚕𝚍𝚒𝚏𝚏𝚎𝚛𝚎𝚗𝚝}$$\left(〈{x}_{1},{x}_{2},\cdots ,{x}_{n}〉\right)$ constraint by using the idea of sorting its variables (i.e., the pure functional dependency part) and by stating that within the sorted list of variables adjacent variables are in strictly increasing order. This leads to the following expression $\mathrm{𝚜𝚘𝚛𝚝}$$\left(〈{x}_{1},{x}_{2},\cdots ,{x}_{n}〉,〈{y}_{1},{y}_{2},\cdots ,{y}_{n}〉\right)\wedge \left({y}_{1}<{y}_{2}\wedge {y}_{2}<{y}_{3}\wedge \cdots \wedge {y}_{n-1}<{y}_{n}\right)\equiv b$.