Number of the records: 1  

On extracting computations from propositional proofs

  1. 1.
    SYSNO ASEP0422140
    Document TypeC - Proceedings Paper (int. conf.)
    R&D Document TypeConference Paper
    TitleOn extracting computations from propositional proofs
    Author(s) Pudlák, Pavel (MU-W) RID, SAI
    Source TitleIARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. - Wadem : Schloss Dagstuhl, Leibniz-Zentrum für Informatik, 2010 / Lodaya K. ; Mahajan M - ISBN 978-3-939897-23-1
    Pagess. 30-41
    Number of pages12 s.
    Publication formPrint - P
    ActionInternational Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010), /30./
    Event date15.12.2010-16.12.2010
    VEvent locationChennai
    CountryIN - India
    Event typeWRD
    Languageeng - English
    CountryDE - Germany
    Keywordsproof complexity ; propositional tautology ; boolean circuits
    Subject RIVBA - General Mathematics
    R&D ProjectsIAA100190902 GA AV ČR - Academy of Sciences of the Czech Republic (AV ČR)
    1M0545 GA MŠMT - Ministry of Education, Youth and Sports (MEYS)
    CEZAV0Z10190503 - MU-W (2005-2011)
    UT WOS000310361000003
    EID SCOPUS84880199880
    DOI10.4230/LIPIcs.FSTTCS.2010.30
    AnnotationThis 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.
    WorkplaceMathematical Institute
    ContactJarmila Štruncová, struncova@math.cas.cz, library@math.cas.cz, Tel.: 222 090 757
    Year of Publishing2014
Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.