Standard
A (biased) proof complexity survey for SAT practitioners. / Nordström, Jakob.
Theory and Applications of Satisfiability Testing, SAT 2014 - 17th International Conference, Held as Part of theVienna Summer of Logic, VSL 2014, Proceedings. Springer Verlag, 2014. s. 1-6 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Bind 8561 LNCS).
Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
Harvard
Nordström, J 2014,
A (biased) proof complexity survey for SAT practitioners. i
Theory and Applications of Satisfiability Testing, SAT 2014 - 17th International Conference, Held as Part of theVienna Summer of Logic, VSL 2014, Proceedings. Springer Verlag, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), bind 8561 LNCS, s. 1-6, 17th International Conference on Theory and Applications of Satisfiability Testing, SAT 2014, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Østrig,
14/07/2014.
https://doi.org/10.1007/978-3-319-09284-3_1
APA
Nordström, J. (2014).
A (biased) proof complexity survey for SAT practitioners. I
Theory and Applications of Satisfiability Testing, SAT 2014 - 17th International Conference, Held as Part of theVienna Summer of Logic, VSL 2014, Proceedings (s. 1-6). Springer Verlag,. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Bind 8561 LNCS
https://doi.org/10.1007/978-3-319-09284-3_1
Vancouver
Nordström J.
A (biased) proof complexity survey for SAT practitioners. I Theory and Applications of Satisfiability Testing, SAT 2014 - 17th International Conference, Held as Part of theVienna Summer of Logic, VSL 2014, Proceedings. Springer Verlag,. 2014. s. 1-6. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Bind 8561 LNCS).
https://doi.org/10.1007/978-3-319-09284-3_1
Author
Nordström, Jakob. / A (biased) proof complexity survey for SAT practitioners. Theory and Applications of Satisfiability Testing, SAT 2014 - 17th International Conference, Held as Part of theVienna Summer of Logic, VSL 2014, Proceedings. Springer Verlag, 2014. s. 1-6 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Bind 8561 LNCS).
Bibtex
@inproceedings{6ff76f7ceb41478a8e93855863d71d97,
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 (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag,",
pages = "1--6",
booktitle = "Theory and Applications of Satisfiability Testing, SAT 2014 - 17th International Conference, Held as Part of theVienna Summer of Logic, VSL 2014, Proceedings",
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",
}
RIS
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.
UR - http://www.scopus.com/inward/record.url?scp=84958536048&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-09284-3_1
DO - 10.1007/978-3-319-09284-3_1
M3 - Article in proceedings
AN - SCOPUS:84958536048
SN - 9783319092836
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 1
EP - 6
BT - Theory and Applications of Satisfiability Testing, SAT 2014 - 17th International Conference, Held as Part of theVienna Summer of Logic, VSL 2014, Proceedings
PB - Springer Verlag,
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 -
