A (biased) proof complexity survey for SAT practitioners

Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceeding

Bibtex

@inproceedings{ebc4e2839f4e4b7589a7c83c59a194d0,
title = "A (biased) proof complexity survey for SAT practitioners",
abstract = "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{\"o}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.",
author = "Jakob Nordstr{\"o}m",
year = "2014",
doi = "10.1007/978-3-319-09284-3_1",
language = "English",
isbn = "9783319092836",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "1--6",
booktitle = "Theory and Applications of Satisfiability Testing, SAT 2014",
address = "Germany",
note = "17th International Conference on Theory and Applications of Satisfiability Testing, SAT 2014, Held as Part of the Vienna Summer of Logic, VSL 2014 ; Conference date: 14-07-2014 Through 17-07-2014",

}