From small space to small width in resolution
2014 (English)In: 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing , 2014, Vol. 25, 300-311 p.Conference paper (Refereed)
In 2003, Atserias and Dalmau resolved a major open question about the resolution proof system by establishing that the space complexity of formulas is always an upper bound on the width needed to refute them. Their proof is beautiful but somewhat mysterious in that it relies heavily on tools from finite model theory. We give an alternative, completely elementary, proof that works by simple syntactic manipulations of resolution refutations. As a by-product, we develop a "black-box" technique for proving space lower bounds via a "static" complexity measure that works against any resolution refutation-previous techniques have been inherently adaptive. We conclude by showing that the related question for polynomial calculus (i.e., whether space is an upper bound on degree) seems unlikely to be resolvable by similar methods.
Place, publisher, year, edition, pages
Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing , 2014. Vol. 25, 300-311 p.
, Leibniz International Proceedings in Informatics, LIPIcs, ISSN 1868-8969 ; 25
PCR, Polynomial calculus, Proof complexity, Resolution, Space, Width
Computer and Information Science
IdentifiersURN: urn:nbn:se:kth:diva-158079DOI: 10.4230/LIPIcs.STACS.2014.300ScopusID: 2-s2.0-84907818998ISBN: 978-393989765-1OAI: oai:DiVA.org:kth-158079DiVA: diva2:774286
31st International Symposium on Theoretical Aspects of Computer Science, STACS 2014, Lyon, France, 5 March 2014 through 8 March 2014
QC 201412222014-12-222014-12-222014-12-22Bibliographically approved