APA in text reference fixes

chapters/2_background.tex

@@ -15,7 +15,7 @@ For example, an assembly language allows you to abstract from the machine instru
 And, early imperative programming languages, like FORTRAN, were the first to offer abstraction from the processor architecture of the targeted system.
 Consequently, in current times, writing a computer program requires little knowledge of how the targeted computer system operates.
 
-\Citeauthor{freuder-1997-holygrail} states that the ``Holy Grail'' of programming languages would be where the user merely states the problem, and the computer solves it and that constraint modelling is one of the biggest steps towards this goal to this day \autocite*{freuder-1997-holygrail}.
+\textcite{freuder-1997-holygrail} states that the ``Holy Grail'' of programming languages would be where the user merely states the problem, and the computer solves it and that constraint modelling is one of the biggest steps towards this goal to this day.
 \Cmls{} operate different from other computer languages.
 The modeller does not describe how to solve a problem, but rather formalises the requirements of the problem.
 It could be said that a \cmodel{} actually describes the answer to the problem.
@@ -163,7 +163,7 @@ These items are not constrained to occur in any particular order.
 We will briefly discuss the most important model items.
 Note that these items will already refer to \minizinc{} expressions, which will be discussed in \cref{subsec:back-mzn-expr}.
 For a detailed overview of the structure of \minizinc{} models the full syntactic structure of \minizinc{} 2.5.5 can be consulted in \cref{ch:minizinc-grammar}.
-\Citeauthor{nethercote-2007-minizinc} offer a detailed discussion of the \minizinc{} \autocite*{nethercote-2007-minizinc}.
+\textcite{nethercote-2007-minizinc} offer a detailed discussion of the \minizinc{}.
 And, much of its history can be learned by the description of its predecessor, \zinc{} \autocite{marriott-2008-zinc}.
 
 \paragraph{Declaration Items} Values in \minizinc{} are declared in the form \mzninline{@\(T\)@: @\(I\)@ = @\(E\)@}, where:

chapters/4_half_reif.tex

@@ -57,7 +57,7 @@ The complex expressions language used in \cmls{}, such as \minizinc{}, often req
 If the Boolean expression \mzninline{pred(...)} is seen in a non-root context, then a new Boolean \variable{} \mzninline{b} is introduced to replace the expression, its \emph{control} \variable{}.
 The flattener then enforces a \constraint{} \mzninline{pred_reif(...,b)}, which binds the \variable{} to be the \emph{truth-value} of the expression (\ie\ \mzninline{b <-> pred(...)}).
 
-\citeauthor{feydy-2011-half-reif} show that although the usage of \gls{reification} in the flattening process is well-understood, it suffers from certain weaknesses:
+\textcite{feydy-2011-half-reif} show that although the usage of \gls{reification} in the flattening process is well-understood, it suffers from certain weaknesses:
 
 \begin{enumerate}
 	\item Many \glspl{reification} are created in the rewriting of partial expressions to accommodate \minizinc{}'s relational semantics.
@@ -832,7 +832,7 @@ The control \variable{} is thus used to communicate any change in context.
 
 We now present experimental evaluation of the presented \gls{half-reif} techniques.
 First, to show the benefit of implementing propagators for half-reified constraint, we compare their performance against their decompositions.
-To do this, we recreate two experiments presented by \citeauthor{feydy-2011-half-reif} in the original \gls{half-reif} paper in a modern \gls{cp} solver, \gls{chuffed} \autocite*{feydy-2011-half-reif}.
+To do this, we recreate two experiments presented by \textcite{feydy-2011-half-reif} in the original \gls{half-reif} paper in a modern \gls{cp} solver, \gls{chuffed}.
 In the experiment, we use propagators implemented according to the principles described in this paper.
 No new algorithm has been devised to perform the propagation.
 The propagator of the original constraint is merely adjusted to influence and watch a control \variable{}.

chapters/4_half_reif_preamble.tex

@@ -1,4 +1,4 @@
-\noindent{}\citeauthor{feydy-2011-half-reif} introduced the notion of \gls{half-reif}\todo{You need an example of what half reification is b -> c !!!} as an improvement over the use of \gls{reification} \autocite*{feydy-2011-half-reif}.
+\noindent{}\textcite{feydy-2011-half-reif} introduced the notion of \gls{half-reif}\todo{You need an example of what half reification is b -> c !!!} as an improvement over the use of \gls{reification}.
 They show that some of the problems and expenses of the use of \gls{reification} can be mitigated using this technique.
 In addition, the creation of propagators for \glspl{half-reif} of constraints can often be an easy process.
 It is not always possible, however, to use a \gls{half-reif} instead of a \gls{reification}.
@@ -8,7 +8,7 @@ The chosen subset omits let-expressions, which can complicate the process.
 An identifier for the same expression can suddenly occur in multiple locations.
 
 This chapter re-evaluates the usage of \gls{half-reif} and provides the first full implementation of a flattener for \minizinc{} with support for \gls{half-reif}.
-In \cref{sec:half-intro,sec:half-propagation} we introduce the core concepts of \gls{half-reif} and propagators for half-reified \constraints{}, as discussed by \citeauthor{feydy-2011-half-reif}.
+In \cref{sec:half-intro,sec:half-propagation} we introduce the core concepts of \gls{half-reif} and propagators for half-reified \constraints{}, as discussed by \textcite{feydy-2011-half-reif}.
 An additional benefit of \gls{half-reif} is that its decomposition can be significantly smaller than the decomposition of a \gls{reification}.
 \Cref{sec:half-decomposition} shows the benefits of \gls{half-reif} when writing decompositions for \gls{mip} and \gls{sat} \solvers{}.
 In \cref{sec:half-context} we introduce our new context analysis algorithm: a way to determine where \gls{half-reif} can be used in \microzinc{}, and by extension \minizinc{}.

chapters/A2_benchmark.tex

@@ -265,7 +265,7 @@ The incremental experiments presented in \cref{sec:inc-experiments} are based on
 \end{multicols}
 
 
-\paragraph{Prize Collecting Path} This problem was introduced in by \citeauthor{feydy-2011-half-reif} in the original paper on \gls{half-reif} \autocite*{feydy-2011-half-reif}.
+\paragraph{Prize Collecting Path} This problem was introduced in by \textcite{feydy-2011-half-reif} in the original paper on \gls{half-reif}.
 In this thesis it is used to benchmark the implementation of a propagator for the \gls{half-reif} of the \mzninline{element} constraint.
 This experiment is shown in \cref{sec:half-experiments}.
 \Cref{lst:bench-prize} shows a \minizinc{} model that can be used to solve the problem.
@@ -280,7 +280,7 @@ The data and original model are available at:
 	\caption{\label{lst:bench-prize} A \minizinc{} model for the Prize Collecting Path problem}
 \end{listing}
 
-\paragraph{QCP-Max} This problem was introduced in by \citeauthor{feydy-2011-half-reif} in the original paper on \gls{half-reif} \autocite*{feydy-2011-half-reif}.
+\paragraph{QCP-Max} This problem was introduced in by \textcite{feydy-2011-half-reif} in the original paper on \gls{half-reif}.
 In this thesis it is used to benchmark the implementation of a propagator for the \gls{half-reif} of the \mzninline{all_different} constraint.
 This experiment is shown in \cref{sec:half-experiments}.
 \Cref{lst:bench-qcpmax} shows a \minizinc{} model that can be used to solve the problem.