diff --git a/doc/dependency.pdf b/doc/dependency.pdf
index dc62f46a..1d82b26a 100644
Binary files a/doc/dependency.pdf and b/doc/dependency.pdf differ
diff --git a/doc/dependency.tex b/doc/dependency.tex
index 4d69771f..c46ed745 100644
--- a/doc/dependency.tex
+++ b/doc/dependency.tex
@@ -56,10 +56,9 @@ package $i$ is installable.\\
 ...
 
 The system is thus understood as the conjunction of such facts, giving
-us a logical programming formulation to determine installation conditions.
-
-Note that for simplicity we do not consider the nuances in upgrade and
-remove operations at the moment.
+us a logical programming formulation to determine installation
+conditions. Note that for simplicity we do not consider the nuances in
+upgrade and remove operations at the moment.
 
 However, using a SAT solver for this operation may be shooting a fly
 with a bazooka. We observe that only certain forms of propositions
@@ -197,6 +196,8 @@ the number of alternatives for comar OM $A$; the problem is that there
 seems to be no simple solution to solve satisfiability with arbitrary
 disjunctions in package dependency, short of a $SAT$ solver).
 
+The resolution of conflicts 
+
 \section{Examples}
 
 \subsection{A single package upgrade}