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.
1 lines
344 B
1 lines
344 B
\item \self Explain the basic \textit{DPLL algorithm} for checking satisfiability of propositional formulas in \textit{Conjunctive Normal Form (CNF)}. Give a pseudo-code implementation to illustrate your explanations. For simplicity, you can skip all advanced concepts such as Boolean Constraint Propagation, Pure Literals, and Clause Learning.
|