Dekker1/dekker-phd-thesis
Archived
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Add missing example to reification chapter

Browse Source
This commit is contained in:
Jip J. Dekker 2021-07-28 17:26:18 +10:00
parent ef4fbc658c
commit d91d600e14
No known key found for this signature in database
GPG Key ID: 517DF4A00618C9C3
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
chapters/4_half_reif.tex
View File

@ -204,9 +204,9 @@ Instead, a new explicit \(check\) method has to be devised to implement the \gls
In comparison, a \gls{propagator} for the \gls{reif} of \(c\) cannot be created from these three logical task.
In addition, we require the logical task from a \gls{propagator} of \(\neg{} c\): \(checkNeg\), \(pruneNeg\), and \(entailedNeg\).
Using these additional functions, we can define an algorithm for the \gls{propagator}, shown in \cref{alg:reif-prop}
Although this might seem reasonable for small \constraints{}, such as integer equality, for many \glspl{global} their negation is hard to define.
\todo{Insert good example of global constraint.}
Using these additional functions, we can define an algorithm for the \gls{propagator}, shown in \cref{alg:reif-prop} Although this might seem reasonable for small \constraints{}, such as integer equality, for many \glspl{global} their negation is hard to define.
For example, the negation of the \mzninline{all_different} \constraint{} is a \constraint{} that forces that at least two values are equal.
This far from a common \constraint{} and we are not aware of any \solver{} that implements a \gls{propagator} for it.
\begin{algorithm}[t]