Chapter 7. Proof Complexity and SAT Solving
Sam Buss, Jakob Nordström
Abstract
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.
Topics & Concepts
Resolution (logic)Proof complexityAlgebraic numberMathematicsAlgebra over a fieldComputer scienceDiscrete mathematicsPure mathematicsMathematical proofProgramming languageMathematical analysisGeometryLogic, programming, and type systemsLogic, Reasoning, and KnowledgeFormal Methods in Verification