AMAI
2005
Springer
13 years 4 months ago
2005
Springer
Many algorithms for Boolean satisfiability (SAT) work within the framework of resolution as a proof system, and thus on unsatisfiable instances they can be viewed as attempting to...