Name
Abstract | ||
|---|---|---|
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 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 captures 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 without 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. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/978-3-319-40970-2_11 | Lecture Notes in Computer Science |
Field | DocType | Volume |
Polynomial,Upper and lower bounds,Computer science,Theoretical computer science,Mathematical proof,Trade offs,Conflict analysis | Conference | 9710 |
ISSN | Citations | PageRank |
0302-9743 | 2 | 0.36 |
References | Authors | |
25 | 6 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jan Elffers | 1 | 12 | 3.17 |
| Jan Johannsen | 2 | 62 | 4.25 |
| Massimo Lauria | 3 | 2 | 0.36 |
| Thomas Magnard | 4 | 2 | 0.36 |
| Jakob Nordström | 5 | 177 | 21.76 |
| Marc Vinyals | 6 | 28 | 4.91 |