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
Previous revision
Next revision Both sides next revision
sav08:dpll_algorithm_for_sat [2008/03/13 17:45]
vkuncak
sav08:dpll_algorithm_for_sat [2013/04/17 17:34]
vkuncak
Line 28: Line 28:
 Note: for each unit clause and other clause we can perform unit resolution at most once (variable disappears) Note: for each unit clause and other clause we can perform unit resolution at most once (variable disappears)
   * BCP is polynomial procedure   * BCP is polynomial procedure
 +
 +We do not need to keep literals that are subset of existing ones:
 +<​code>​
 +def RemoveSubsumed(S : Set[Clause]) : Set[Clause] =
 +  if there are C1,C2 in S such that C1 subset C2 
 +  then RemoveSubsumes(S - {C2})
 +  else S
 +</​code>​
 +In particular, when we apply unit resolution, the original clause can be deleted.
  
 ===== DPLL Recursively ===== ===== DPLL Recursively =====
Line 39: Line 48:
      val P = pick variable from FV(S')      val P = pick variable from FV(S')
      ​DPLL(F'​ union {p}) or DPLL(F'​ union {Not(p)})      ​DPLL(F'​ union {p}) or DPLL(F'​ union {Not(p)})
-</​code>​ 
- 
-<​code>​ 
-def RemoveSubsumed(S : Set[Clause]) : Set[Clause] = 
-  if there are C1,C2 in S such that C1 subset C2  
-  then RemoveSubsumes(S - {C2}) 
-  else S 
 </​code>​ </​code>​
  
Line 98: Line 100:
     S' \vdash {\it false}     S' \vdash {\it false}
 \] \]
-++++Idea:| 
 From From
 \[ \[
Line 118: 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 ===