On the Complexity of Finding Narrow Proofs

We study the complexity of the following "resolution width problem": Does a given 3-CNF formula have a resolution refutation of width k? For fixed k, refutations of width k can easily be found in polynomial time. We prove a matching polynomial lower bound for the resolution width problem that shows that there is no significant faster way to decide the existence of a width-k refutation than exhaustively searching for it. This lower bound is unconditional and does not rely on any unproven complexity theoretic assumptions. We also prove that the resolution width problem is EXPTIME-complete (if k is part of the input). This confirms a conjecture by Vardi, who has first raised the question for the complexity of the resolution width problem. Furthermore, we prove that the variant of the resolution width problem for regular resolution is PSPACE-complete, confirming a conjecture by Urquhart.

[1]  Albert Atserias,et al.  A combinatorial characterization of resolution width , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..

[2]  Alasdair Urquhart,et al.  Comments on ECCC Report TR06-133: The Resolution Width Problem is EXPTIME-Complete , 2009, Electron. Colloquium Comput. Complex..

[3]  Christoph Berkholz.  Lower Bounds for Existential Pebble Games and k-Consistency Tests , 2012, 2012 27th Annual IEEE Symposium on Logic in Computer Science.

[4]  Eli Ben-Sasson,et al.  Near Optimal Separation Of Tree-Like And General Resolution , 2004, Comb..

[5]  Zvi Galil.  On Resolution with Clauses of Bounded Size , 1977, SIAM J. Comput..

[6]  Toniann Pitassi,et al.  Simplified and improved resolution lower bounds , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[7]  Eli Ben-Sasson,et al.  Short proofs are narrow—resolution made simple , 2001, JACM.

[8]  Martin Grohe.  Equivalence in Finite-Variable Logics is Complete for Polynomial Time , 1999, Comb..

[9]  Armin Haken,et al.  The Intractability of Resolution , 1985, Theor. Comput. Sci..

[10]  Shigeki Iwata,et al.  Some combinatorial game problems require Ω(nk) time , 1984, JACM.

[11]  Johan Håstad,et al.  Towards an optimal separation of space and length in resolution , 2008, Theory Comput..

[12]  Shigeki Iwata,et al.  Classes of pebble games and complete problems , 1979, ACM '78.

[13]  Johannes Klaus Fichte,et al.  Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution , 2011, J. Artif. Intell. Res..

[14]  Alasdair Urquhart,et al.  Width and size of regular resolution proofs , 2012, Log. Methods Comput. Sci..

[15]  Phokion G. Kolaitis,et al.  On the Complexity of Existential Pebble Games , 2003, CSL.

[16]  Alasdair Urquhart,et al.  The Resolution Width Problem is EXPTIME-Complete , 2006, Electron. Colloquium Comput. Complex..

[17]  Alexander Hertel,et al.  Applications of Games to Propositional Proof Complexity , 2008 .

[18]  Jakob Nordstr.  PEBBLE GAMES, PROOF COMPLEXITY, AND TIME-SPACE TRADE-OFFS ∗ , 2013 .

[19]  Pavel Pudlák.  Proofs as Games , 2000, Am. Math. Mon..