From b962b84d19372c60e4927c0b2a90bf39d7ddda57 Mon Sep 17 00:00:00 2001 From: "Jip J. Dekker" Date: Thu, 29 Jul 2021 09:41:05 +1000 Subject: [PATCH] Not so mighty now --- assets/glossary.tex | 4 ++-- chapters/3_rewriting.tex | 2 +- chapters/6_conclusions.tex | 2 +- 3 files changed, 4 insertions(+), 4 deletions(-) diff --git a/assets/glossary.tex b/assets/glossary.tex index d1a7d04..13f094b 100644 --- a/assets/glossary.tex +++ b/assets/glossary.tex @@ -223,7 +223,7 @@ \newglossaryentry{del-rew}{ name={delayed rewriting}, - description={A technique using during \gls{rewriting}. It delays the \gls{rewriting} of \glspl{constraint} whose \gls{decomp} might change based on information that can become available later during the process.}, + description={A technique using during \gls{rewriting}. It delays the \gls{rewriting} of \glspl{constraint} whose \gls{decomp} can change based on information that can become available later during the process.}, } \newglossaryentry{domain}{ @@ -511,7 +511,7 @@ description={ \Glspl{solver} generally make search decisions when they can not directly infer a \gls{sol}. The \gls{solver} then assumes a value for a \gls{variable} or adds a \gls{constraint}. - The decision might have to be revised later. + The decision can be to be revised later. } } diff --git a/chapters/3_rewriting.tex b/chapters/3_rewriting.tex index b39207a..e80b90d 100644 --- a/chapters/3_rewriting.tex +++ b/chapters/3_rewriting.tex @@ -319,7 +319,7 @@ The full set of rules appears in \cref{fig:rew-rewrite-to-nzn-calls,fig:rew-rewr To simplify presentation, we assume that all rules that introduce new identifiers into the \nanozinc{} program do so in a way that ensures those identifiers are fresh (i.e., not used in the rest of the \nanozinc{} program), by suitable alpha renaming. We also present our rules using a \emph{call by name} evaluation strategy, i.e., the arguments to function calls are substituted into function body. As such, they are only evaluated when required for the result of the function. -Although pure \microzinc{} behaves the same under any call evaluation strategy, in implementation a \emph{call by value} strategy might provide more predictable behaviour with debugging functions in the \minizinc{} language, such as \mzninline{trace} and \mzninline{assert}. +Although pure \microzinc{} behaves the same under any call evaluation strategy, in implementation a \emph{call by value} strategy can provide more predictable behaviour with debugging functions in the \minizinc{} language, such as \mzninline{trace} and \mzninline{assert}. \begin{figure*}[p] \centering diff --git a/chapters/6_conclusions.tex b/chapters/6_conclusions.tex index c7970b9..17a09fe 100644 --- a/chapters/6_conclusions.tex +++ b/chapters/6_conclusions.tex @@ -141,7 +141,7 @@ It is, however, still a significant improvement over repeatedly \gls{rewriting} The improvements offered by these new methods may spark future research. Primarily, they will allow and promote using \gls{meta-optimization} algorithms in \cmls{} for new problems. It could even be worthwhile to revisit existing applications of incremental constraint modelling. -The utilization of the presented methods might offer a significant improvement in performance, allowing the solving of more complex problems. +The utilization of the presented methods can offer a significant improvement in performance, allowing the solving of more complex problems. Finally, new \gls{meta-optimization} techniques could require extensions of the methods presented. \section*{Summary}