Lab for Automated Reasoning and Analysis LARA

Differences

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

Link to this comparison view

Both sides previous revision Previous revision
sav08:advanced_sat_solving_techniques [2010/03/02 15:22]
piskac
sav08:advanced_sat_solving_techniques [2010/03/02 15:25] (current)
piskac
Line 102: Line 102:
  
 Restart: if no progress for a while, start over (keeping some lemmas), will most likely do different branching. Restart: if no progress for a while, start over (keeping some lemmas), will most likely do different branching.
 +
  
  
Line 108: Line 109:
  
   * [[http://​portal.acm.org/​citation.cfm?​id=1217859|Solving SAT and SAT Modulo Theories: From an abstract Davis--Putnam--Logemann--Loveland procedure to DPLL(T)]]   * [[http://​portal.acm.org/​citation.cfm?​id=1217859|Solving SAT and SAT Modulo Theories: From an abstract Davis--Putnam--Logemann--Loveland procedure to DPLL(T)]]
 +
 +  * [[http://​www.csee.ogi.edu/​~krstics/​smtarch.pdf|Architecting Solvers for SAT Modulo Theories: Nelson-Oppen with DPLL]]
  
  
 
sav08/advanced_sat_solving_techniques.txt · Last modified: 2010/03/02 15:25 by piskac
 
© EPFL 2018 - Legal notice