A (biased) proof complexity survey for SAT practitioners
Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
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.
| Originalsprog | Engelsk |
|---|---|
| Titel | Theory and Applications of Satisfiability Testing, SAT 2014 - 17th International Conference, Held as Part of theVienna Summer of Logic, VSL 2014, Proceedings |
| Antal sider | 6 |
| Forlag | Springer Verlag, |
| Publikationsdato | 2014 |
| Sider | 1-6 |
| ISBN (Trykt) | 9783319092836 |
| DOI | |
| Status | Udgivet - 2014 |
| Eksternt udgivet | Ja |
| Begivenhed | 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 Varighed: 14 jul. 2014 → 17 jul. 2014 |
Konference
| Konference | 17th International Conference on Theory and Applications of Satisfiability Testing, SAT 2014, Held as Part of the Vienna Summer of Logic, VSL 2014 |
|---|---|
| Land | Østrig |
| By | Vienna |
| Periode | 14/07/2014 → 17/07/2014 |
| Sponsor | 17th International Conference on Theory and, Applications of Satisfiability Testing, SAT 2014,, Held as Part of the Vienna Summer of Logic, VSL 2014 |
| Navn | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Vol/bind | 8561 LNCS |
| ISSN | 0302-9743 |
ID: 251869794