A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
Trade-offs Between Time and Memory in a Tighter Model of CDCL SAT Solvers
[chapter]
2016
Lecture Notes in Computer Science
A long line of research has studied the power of conflictdriven clause learning (CDCL) and how it compares to the resolution proof system in which it searches for proofs. It has been shown that CDCL can polynomially simulate resolution even with an adversarially chosen learning scheme as long as it is asserting. However, the simulation only works under the assumption that no learned clauses are ever forgotten, and the polynomial blow-up is significant. Moreover, the simulation requires very
doi:10.1007/978-3-319-40970-2_11
fatcat:4jiqks3o7rgsrim2njfx36rt54