diff --git a/chapters/5_incremental.tex b/chapters/5_incremental.tex
index d73765a..8d2a87c 100644
--- a/chapters/5_incremental.tex
+++ b/chapters/5_incremental.tex
@@ -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}