CORR
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. The Boolean satisfiability problem (SAT) can be solved efficiently with variants of the DPLL algorithm. For industrial SAT problems, DPLL with conflict analysis depend...