Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
|
sav08:dpll_algorithm_for_sat [2008/03/12 18:28] vkuncak |
sav08:dpll_algorithm_for_sat [2008/03/12 18:34] vkuncak |
||
|---|---|---|---|
| Line 109: | Line 109: | ||
| \] | \] | ||
| Then combine these two trees with resolution on $\{p\}$ and $\{\lnot p\}$ to get ${\it false}$. | Then combine these two trees with resolution on $\{p\}$ and $\{\lnot p\}$ to get ${\it false}$. | ||
| + | |||
| + | Why can we modify resolution proof to move $p$ from assumption and put its negation to conclusion? | ||
| ++++ | ++++ | ||
| + | |||
| + | === Lower Bounds on Running Time === | ||
| Observation: constructed resolution proof is polynomial in the running time of the DPLL algorithm. | Observation: constructed resolution proof is polynomial in the running time of the DPLL algorithm. | ||