This commit is contained in:
Binary file not shown.
+5
-4
@@ -56,10 +56,9 @@ package $i$ is installable.\\
|
|||||||
...
|
...
|
||||||
|
|
||||||
The system is thus understood as the conjunction of such facts, giving
|
The system is thus understood as the conjunction of such facts, giving
|
||||||
us a logical programming formulation to determine installation conditions.
|
us a logical programming formulation to determine installation
|
||||||
|
conditions. Note that for simplicity we do not consider the nuances in
|
||||||
Note that for simplicity we do not consider the nuances in upgrade and
|
upgrade and remove operations at the moment.
|
||||||
remove operations at the moment.
|
|
||||||
|
|
||||||
However, using a SAT solver for this operation may be shooting a fly
|
However, using a SAT solver for this operation may be shooting a fly
|
||||||
with a bazooka. We observe that only certain forms of propositions
|
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
|
seems to be no simple solution to solve satisfiability with arbitrary
|
||||||
disjunctions in package dependency, short of a $SAT$ solver).
|
disjunctions in package dependency, short of a $SAT$ solver).
|
||||||
|
|
||||||
|
The resolution of conflicts
|
||||||
|
|
||||||
\section{Examples}
|
\section{Examples}
|
||||||
|
|
||||||
\subsection{A single package upgrade}
|
\subsection{A single package upgrade}
|
||||||
|
|||||||
Reference in New Issue
Block a user