Proof Complexity and SAT Solving
Research output: Chapter in Book/Report/Conference proceeding › Book chapter › Research › peer-review
This chapter gives an overview of proof complexity and connections to SAT solving, focusing on proof systems such as resolution, Nullstellensatz, polynomial calculus, and cutting planes (corresponding to conflict-driven clause learning, algebraic approaches using linear algebra or Gröbner bases, and pseudo-Boolean solving, respectively). There is also a discussion of extended resolution (which is closely related to DRAT proof logging) and Frege and extended Frege systems more generally. An ample supply of references for further reading is provided, including for some topics omitted in this chapter.
Original language | English |
---|---|
Title of host publication | Handbook of Satisfiability |
Editors | Armin Biere, Marijn J. H. Heule, Hans van Maaren, Toby Walsh |
Publisher | IMIA and IOS Press |
Publication date | 2021 |
Edition | 2 |
Pages | 233 - 350 |
Chapter | 7 |
ISBN (Print) | 978-1-64368-160-3 |
ISBN (Electronic) | 978-1-64368-161-0 |
DOIs | |
Publication status | Published - 2021 |
Series | Frontiers in Artificial Intelligence and Applications |
---|---|
Volume | 336 |
ISSN | 0922-6389 |
Bibliographical note
Chapter to appear in the 2nd edition. Draft version available at http://www.csc.kth.se/~jakobn/research/ProofComplexityChapter.pdf
ID: 251872222