You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
|
|
\item \self Use the DPLL algorithm (\emph{without} BCP, PL and clause learning) to determine whether or not the set of clauses given is satisfiable. Decide variables in alphabetical order starting with the \textit{positive} phase. If the set of clauses resulted in \texttt{SAT}, give a satisfying model.
\begin{dpllCNFInput} \item $(\lnot a \lor b \lor \lnot c)$ \item $(a \lor \lnot b \lor c)$ \item $(\lnot a \lor \lnot b \lor c)$ \item $(a \lor b \lor \lnot c)$ \end{dpllCNFInput}
% (not a or b or not c) and ( a or not b or c) and (not a or not b or c) and (a or b or not c)
|
