LARA

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision Both sides next revision
sav08:dpll_algorithm_for_sat [2008/03/13 17:46]
vkuncak
sav08:dpll_algorithm_for_sat [2013/04/17 17:34]
vkuncak
Line 100: Line 100:
     S' \vdash {\it false}     S' \vdash {\it false}
 \] \]
-++++Idea:| 
 From From
 \[ \[
Line 120: Line 119:
  
 Why can we modify resolution proof to move $p$ from assumption and put its negation to conclusion? Why can we modify resolution proof to move $p$ from assumption and put its negation to conclusion?
-+++++
  
 === Lower Bounds on Running Time === === Lower Bounds on Running Time ===