Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC BY-NC-ND 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSTTCS.2010.30
URN: urn:nbn:de:0030-drops-28512
URL: https://drops.dagstuhl.de/opus/volltexte/2010/2851/
Pudlák, Pavel
On extracting computations from propositional proofs (a survey)
| pdf-format: |
|
Abstract
This paper describes a project that aims at showing that propositional proofs of certain tautologies in weak proof system give upper bounds on the computational complexity of functions associated with the tautologies. Such bounds can potentially be used to prove (conditional or unconditional) lower bounds on the lengths of proofs of these tautologies and show separations of some weak proof systems. The prototype are the results showing the feasible interpolation property for resolution. In order to prove similar results for systems stronger than resolution one needs to define suitable generalizations of boolean circuits. We will survey the known results concerning this project and sketch in which direction we want to generalize them.
BibTeX - Entry
@InProceedings{pudlk:LIPIcs:2010:2851,
author = {Pavel Pudl{\'a}k},
title = {{On extracting computations from propositional proofs (a survey)}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)},
pages = {30--41},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-23-1},
ISSN = {1868-8969},
year = {2010},
volume = {8},
editor = {Kamal Lodaya and Meena Mahajan},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2010/2851},
URN = {urn:nbn:de:0030-drops-28512},
doi = {10.4230/LIPIcs.FSTTCS.2010.30},
annote = {Keywords: proof complexity, propositional tautology, boolean circuits, resolution, feasible interpolation}
}
| Keywords: | proof complexity, propositional tautology, boolean circuits, resolution, feasible interpolation | |
| Seminar: | IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010) | |
| Issue date: | 2010 | |
| Date of publication: | 14.12.2010 |
