TY - GEN
T1 - A (biased) proof complexity survey for SAT practitioners
AU - Nordström, Jakob
PY - 2014
Y1 - 2014
N2 - This talk is intended as a selective survey of proof complexity, focusing on some comparatively weak proof systems that are of particular interest in connection with SAT solving. We will review resolution, polynomial calculus, and cutting planes (related to conflict-driven clause learning, Gröbner basis computations, and pseudo-Boolean solvers, respectively) and some proof complexity measures that have been studied for these proof systems. We will also briefly discuss if and how these proof complexity measures could provide insights into SAT solver performance.
AB - This talk is intended as a selective survey of proof complexity, focusing on some comparatively weak proof systems that are of particular interest in connection with SAT solving. We will review resolution, polynomial calculus, and cutting planes (related to conflict-driven clause learning, Gröbner basis computations, and pseudo-Boolean solvers, respectively) and some proof complexity measures that have been studied for these proof systems. We will also briefly discuss if and how these proof complexity measures could provide insights into SAT solver performance.
U2 - 10.1007/978-3-319-09284-3_1
DO - 10.1007/978-3-319-09284-3_1
M3 - Paper in conference proceeding
AN - SCOPUS:84958536048
SN - 9783319092836
T3 - Lecture Notes in Computer Science
SP - 1
EP - 6
BT - Theory and Applications of Satisfiability Testing, SAT 2014
PB - Springer
T2 - 17th International Conference on Theory and Applications of Satisfiability Testing, SAT 2014, Held as Part of the Vienna Summer of Logic, VSL 2014
Y2 - 14 July 2014 through 17 July 2014
ER -