spell check op ass1

diff --git a/report/appendix.tex b/report/appendix.tex
index af3d429..a73397c 100644 (file)
--- a/report/appendix.tex
+++ b/report/appendix.tex
@@ -1,6 +1,6 @@
 \begin{listing}[H]
        \caption{Domain description task 1}
-       \label{domaintasktask1}
+       \label{domaintask1}
        \prologcode{./src/domaintask1.pl}
 \end{listing}
 \begin{listing}[H]

diff --git a/report/ass1.tex b/report/ass1.tex
index 0e4034e..5f92b34 100644 (file)
--- a/report/ass1.tex
+++ b/report/ass1.tex
@@ -11,7 +11,7 @@
        \item{Q2}\\
                We use the functions $agent(X, S_i), crate(cratename, X, S_i)$ and
                $target(cratename, X)$ to easily represent the information. We chose to
-               hardcode the locations of the crates because then the resolution will be
+               hard code the locations of the crates because then the resolution will be
                much faster.
        \item{Q3}\\
                $\begin{array}{llllll}
@@ -111,16 +111,16 @@
 \subsection{Part 2: Implementation}
 \subsubsection{Task 3: Translate Axioms}
 The domain description can be found in \textit{./src/domaintask1.pl} and in
-Listing~\ref{domaintask1} and is a literal translation from logics to prolog
-code except for the visited predicate. The visited predicate disallows the
-agent to reverse it's previous move immediatly. This makes the planning much
-faster because it can cut of a lot of branches.
+Listing~\ref{domaintask1} and is a literal translation from logics to
+\textit{prolog} code except for the visited predicate. The visited predicate
+disallows the agent to reverse it's previous move immediately. This makes the
+planning much faster because it can cut of a lot of branches.
 
 \subsubsection{Task 4: The Planning Problem in Figure 1}
 The instance description for this task can be found in
 \textit{./src/instancetask4.pl} and in Listing~\ref{instancetask4}. This is a
 literal translation of the description in logics. The goal location for the
-crates are hardcoded to increase the performance.
+crates are hard coded to increase the performance.
 
 \subsubsection{Task 5: Crates go to Any Goal Location}
 The instance description for this task can be found in
@@ -136,11 +136,11 @@ describes if the agent has visited that particular location. In the instance
 description found in \textit{./src/instancetask6.pl} or in
 Listing~\ref{instancetask6} we made sure to mark the starting location for the
 agent as visited because the agent does not have to revisit the starting
-location. The goal is a simple forall that will only satisfy if for all
-locations known the visited fluent is true. To generate all locations we used
-the fact that all locations are connected to some other location. This could be
-implemented more efficiently because in the current situation the locations
-sequence contains a lot of duplicate locations. We reused the domain
+location. The goal is a simple \textit{forall} that will only satisfy if for
+all locations known the visited fluent is true. To generate all locations we
+used the fact that all locations are connected to some other location. This
+could be implemented more efficiently because in the current situation the
+locations sequence contains a lot of duplicate locations. We reused the domain
 description from task 4 with the visited fluent and adapted it slightly so that
 it is never unset and therefore records all locations the agent has been. The
 full ode can be found in \textit{./src/domaintask6.pl} or in
@@ -155,19 +155,19 @@ that define were the keys are found. We also changed the crate fluent to arity
 $4$ so that it also has a key attached to it. In the domain specification,
 found in \textit{./src/domaintask7.pl} or Listing~\ref{domaintask7}, we added a
 pickup move that allows the agent to pickup a certain key. When the agent picks
-up a key the keyinbag fluent is then set so that the possibility function for
-the push action can incorporate the fact that a key has to be picked up to push
-a certain crate.
+up a key the \textit{keyinbag} fluent is then set so that the possibility
+function for the push action can incorporate the fact that a key has to be
+picked up to push a certain crate.
 
 \newpage
 \subsection{Part 4: General questions}
 \subsubsection{Task 10: Sitcalc expressivity}
-Situation calculus(sitcalc from now on) is very expressive because you can
-express yourself very detailed without encountering the frame problem. When the
-problem space expands the computational strength needed explodes. Sitcalc is
-therefore not very usefull when you want to plan far behind. For comparison,
-calculating a sokoban path 10 steps in the future already takes hours on a
-normal computer.
+Situation calculus(\textit{sitcalc} from now on) is very expressive because you
+can express yourself very detailed without encountering the frame problem. When
+the problem space expands the computational strength needed explodes.
+\textit{Sitcalc} is therefore not very useful when you want to plan far behind.
+For comparison, calculating a \textit{sokoban} path 10 steps in the future
+already takes hours on a normal computer.
 
 The model is easy to extend to bigger and more complex problems, it doesn't
 scale that well however...
@@ -175,6 +175,6 @@ scale that well however...
 \subsubsection{Task 11: Related work}
 Zhou, N. (2013). A Tabled Prolog Program for Solving Sokoban, 124, 561–575. doi:10.3233/FI-2013-849
 
-The paper treats the sokoban problem as a general shortest path problem. And it
-also uses lookup tables to speed up the search. This was used in a competition
-on certain sokoban problems.
+The paper treats the \textit{sokoban} problem as a general shortest path
+problem. And it also uses lookup tables to speed up the search. This was used
+in a competition on certain \textit{sokoban} problems.