Index: /reasoner/mainAlgorithms.tex
===================================================================
--- /reasoner/mainAlgorithms.tex	(revision 192)
+++ /reasoner/mainAlgorithms.tex	(revision 193)
@@ -137,7 +137,7 @@
 \subsection{Top-level Constraint Translation}\label{sectTopLevelConstraintsTranslation}
 
-The core idea of the constraint translation is to collect the constraints following the structure of an IVML model and to replace each type-related variable by the correct accessor expression for a global variable in the current scope. According to the IVML specification~\cite{IVML-LS}, the relevant top-level elements are variable declarations, global constraints, annotation assignment blocks and eval-blocks. Type definitions are considered when when processing variable declarations, as the individual type of a variable indicates the specific constraints to be collected and instantiated.
-
-As Algorithm \ref{algTranslateConstraints} focuses on top-level constraints and delegates more complex transformations to sub-sequent algorithms, in particular Algorithm \ref{algTranslateDeclaration} for variable declarations, and top-level constraints exclusively use qualified variable access expressions, the translation patterns are rather straightforward. Top-level constraints, constraints in (nested) annotation assignments and constraints in (nested) eval blocks are taken over as specified into the constraint base. However, constraints in eval-blocks must be prioritized over the remaining constraints~\cite{IVML-LS}.
+The core idea of the constraint translation is to collect the constraints defined in an IVML project and to replace each nested variable by an appropriate accessor expression starting at a global variable. Therefore, the translation analyzes the top-level IVML elements that can define constraints~\cite{IVML-LS}, namely variable declarations, global constraints, annotation assignment blocks and eval-blocks. Type definitions come into play when (nested) variable declarations are processed: Complex or derived types may lead to nested variables, annotation assignments, and, in particular, (type-specific) constraints to be collected and translated recursively.
+
+Algorithm \ref{algTranslateConstraints} is the entry point into the constraint translation. The algorithm focuses exclusively on top-level constraints and delegates more complex translations to sub-sequent, potentially recursive algorithms. Algorithm \ref{algTranslateConstraints} realizes the following translation patterns:
 
 \grayPara{
@@ -148,4 +148,7 @@
 \end{gather*}
 }
+
+Top-level constraints are defined using top-level variables, which are already fully qualified so no translation is needed, because these variables already represent complete access expressions. This is indicated by the first translation pattern. Similarly, constraints defined in top-level (nested) annotation assignments are already qualified and can be directly used for reasoning as indicated by the second translation pattern. Moreover, annotation assignments represent constraints that assign values to annotations of contained declared (top-level) variables. Similarly, these constraints can be used in reasoning without translation. This is implied in the second translation pattern. Also the variables used in constraints listed in (nested) top-level eval-blocks are fully qualified. In contrast, the evaluation of constraints in eval blocks must be prioritized over the other (top-level) constraints~\cite{IVML-LS}.
+
 
 Algorithm \ref{algTranslateConstraints} illustrates the top-level constraint translation. As a side effect, the constraint translation identifies and translates the constraints in the respective project\footnote{The top-translation steps in this algorithm are realized in the implementation by an IVML model visitor implicitly identifying and handling the types without iterating over the project multiple times as the notation here might suggest.}. To prioritize the constraints correctly, the reasoner uses four global sets, which are populated during the constraint translation and, finally, in Algorithm \ref{algTranslateConstraints} added to the constraint base. In more details, the reasoner maintains the following temporary constraint sets