Pebble games, proof complexity, and time-space trade-offs
Research output: Contribution to journal › Journal article › Research › peer-review
Pebble games were extensively studied in the 1970s and 1980s in a number of different contexts. The last decade has seen a revival of interest in pebble games coming from the field of proof complexity. Pebbling has proven to be a useful tool for studying resolution-based proof systems when comparing the strength of different subsystems, showing bounds on proof space, and establishing size-space trade-offs. This is a survey of research in proof complexity drawing on results and tools from pebbling, with a focus on proof space lower bounds and trade-offs between proof size and proof space.
Original language | English |
---|---|
Article number | 15 |
Journal | Logical Methods in Computer Science |
Volume | 9 |
Issue number | 3 |
ISSN | 1860-5974 |
DOIs | |
Publication status | Published - 13 Sep 2013 |
Externally published | Yes |
- CDCL, Cutting planes, DPLL, k-DNF resolution, Length, PCR, Pebble games, Pebbling formulas, Polynomial calculus, Proof complexity, Resolution, SAT solving, Separation, Space, Trade-off, Width
Research areas
ID: 251870251