Trade-offs Between Time and Memory in a Tighter Model of CDCL SAT Solvers

@inproceedings{Elffers2016TradeoffsBT,
  title={Trade-offs Between Time and Memory in a Tighter Model of CDCL SAT Solvers},
  author={Jan Elffers and Jan Johannsen and Massimo Lauria and Thomas Magnard and Jakob Nordstr{\"o}m and Marc Vinyals},
  booktitle={SAT},
  year={2016}
}
A long line of research has studied the power of conflict-driven 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… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-4 OF 4 CITATIONS

References

Publications referenced by this paper.
SHOWING 1-10 OF 33 REFERENCES

Chaff: engineering an efficient SAT solver

  • Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232)
  • 2001
VIEW 6 EXCERPTS
HIGHLY INFLUENTIAL

Small Stone in Pool

  • Logical Methods in Computer Science
  • 2014
VIEW 1 EXCERPT