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.
10 lines
586 B
10 lines
586 B
\item Use the DPLL algorithm with \textit{Boolean Constrain Propagation} and \textit{Pure Literals} (\emph{without} 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 c \lor \lnot d)$
|
|
\item $(a \lor \lnot d \lor \lnot e )$
|
|
\item $(e \lor \lnot c)$
|
|
\item $(c \lor b)$
|
|
\item $(\lnot b \lor \lnot c)$
|
|
\item $(a \lor b)$
|
|
\end{dpllCNFInput}
|