Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision | Next revision Both sides next revision | ||
|
sav08:homework04 [2008/03/12 18:55] vkuncak |
sav08:homework04 [2008/03/12 19:00] vkuncak |
||
|---|---|---|---|
| Line 7: | Line 7: | ||
| ===== Problem 2 ===== | ===== Problem 2 ===== | ||
| - | Build a DPLL SAT solver that accepts input in the CNF version of the [[DIMACS format]]. (The input file is a formula in conjunctive normal form, where each clause is given on a separate line as a list of indices denoting propositional variables, a negative index indicates a negated propositional variable.) | + | Build a [[DPLL Algorithm for SAT|DPLL SAT solver]] that accepts input in the CNF version of the [[DIMACS format]]. (The input file is a formula in conjunctive normal form, where each clause is given on a separate line as a list of indices denoting propositional variables, a negative index indicates a negated propositional variable.) |
| If a given formula is satisfiable, the SAT solver should produce an assignment to all variables such that the formula evaluates to //true// under this assignment. | If a given formula is satisfiable, the SAT solver should produce an assignment to all variables such that the formula evaluates to //true// under this assignment. | ||