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

Better transition between incremental methods

Browse Source
This commit is contained in:
Jip J. Dekker 2021-07-27 20:52:41 +10:00
parent 3389133fc9
commit a05ba139ae
No known key found for this signature in database
GPG Key ID: 517DF4A00618C9C3
1 changed files with 2 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
chapters/5_incremental.tex
View File

@ -499,7 +499,8 @@ If \mzninline{b3} is set to \true{}, the \constraint{} in \lref{line:6:x1:end} b
Furthermore, it is not strictly necessary to guard \mzninline{int_uniform} against being invoked before the first \gls{sol} is found.
The \mzninline{sol} \constraints{} will simply not propagate anything until the first \gls{sol} is recorded, but we use this simple example to illustrate how these Boolean conditions are rewritten and evaluated.
\todo{There's something missing here to conclude the section. Perhaps just a forward pointer to the experiments, or something like ``Now we've seen how to do this with solver support. In the next section, we will see how to do this without solver support.'' — Guido}
In \cref{sec:inc-experiments} we assess the performance of \gls{rbmo}, which can be used when supported by the target \solver{}.
In the next section, we discuss how \gls{meta-optimization} can still be efficiently applied through the use of \gls{incremental-rewriting}.
\section{An Incremental Constraint Modelling Interface}%
\label{sec:inc-incremental-compilation}