Trade-offs between time and memory in a tighter model of CDCL SAT solvers

Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceeding


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 forgot- ten, and the polynomial blow-up is significant. Moreover, the simulation requires very frequent restarts, whereas the power of CDCL with less frequent or entirely without restarts remains poorly understood. With a view towards obtaining results with tighter relations between CDCL and resolution, we introduce a more fine-grained model of CDCL that cap- tures not only time but also memory usage and number of restarts. We show how previously established strong size-space trade-offs for resolution can be transformed into equally strong trade-offs between time and memory usage for CDCL, where the upper bounds hold for CDCL with- out any restarts using the standard 1UIP clause learning scheme, and the (in some cases tightly matching) lower bounds hold for arbitrarily frequent restarts and arbitrary clause learning schemes.


  • Jan Elffers
  • Jan Johannsen
  • Massimo Lauria
  • Thomas Magnard
  • Jakob Nordström
  • Marc Vinyals
Externa organisationer
  • KTH Royal Institute of Technology
  • Polytechnic University of Catalonia
  • École Normale Supérieure
  • Ludwig-Maximilian University of Munich

Ämnesklassifikation (UKÄ) – OBLIGATORISK

  • Datavetenskap (datalogi)
Titel på värdpublikationTheory and Applications of Satisfiability Testing – SAT 2016
Undertitel på gästpublikation19th International Conference, Proceedings
RedaktörerDaniel Le Berre, Nadia Creignou
Antal sidor17
ISBN (tryckt)9783319409696
StatusPublished - 2016
Peer review utfördJa
Externt publiceradJa
Evenemang19th International Conference on Theory and Applications of Satisfiability Testing, SAT 2016 - Bordeaux, Frankrike
Varaktighet: 2016 jul 52016 jul 8


NamnLecture Notes in Computer Science
ISSN (tryckt)0302-9743
ISSN (elektroniskt)1611-3349


Konferens19th International Conference on Theory and Applications of Satisfiability Testing, SAT 2016