A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Towards an optimal separation of space and length in resolution
2008
Proceedings of the fourtieth annual ACM symposium on Theory of computing - STOC 08
Most state-of-the-art satisfiability algorithms today are variants of the DPLL procedure augmented with clause learning. The main bottleneck for such algorithms, other than the obvious one of time, is the amount of memory used. In the field of proof complexity, the resources of time and memory correspond to the length and space of resolution proofs. There has been a long line of research trying to understand these proof complexity measures, as well as relating them to the width of proofs, i.e.,
doi:10.1145/1374376.1374478
dblp:conf/stoc/NordstromH08
fatcat:x2f4caw3rjhjhcho5vohx34o5u