Optimality of size-width tradeoffs for resolution

Abstract.This paper is concerned with the complexity of proofs and of searching for proofs in resolution. We show that the recently proposed algorithm of Ben-Sasson & Wigderson for searching for proofs in resolution cannot give better than weakly exponential performance. This is a consequence of our main result: we show the optimality of the general relationship called size-width tradeoffs in Ben-Sasson & Wigderson. Moreover we obtain the optimality of the size-width tradeoffs for the widely used restrictions of resolution: regular, Davis-Putnam, negative, positive.

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

[2]  Maria Luisa Bonet,et al.  A study of proof search algorithms for resolution and polynomial calculus , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[3]  Donald W. Loveland,et al.  A machine program for theorem-proving , 2011, CACM.

[4]  Ran Raz,et al.  On Interpolation and Automatization for Frege Systems , 2000, SIAM J. Comput..

[5]  Jan Krajícek,et al.  Some Consequences of Cryptographical Conjectures for S12 and EF , 1998, Inf. Comput..

[6]  Alexander A. Razborov.  Improved Resolution Lower Bounds for the Weak Pigeonhole Principle , 2001, Electron. Colloquium Comput. Complex..

[7]  Alexander A. Razborov,et al.  Electronic Colloquium on Computational Complexity, Report No. 75 (2001) Resolution Lower Bounds for the Weak Functional Pigeonhole Principle , 2001 .

[8]  Stephen A. Cook,et al.  The Relative Efficiency of Propositional Proof Systems , 1979, Journal of Symbolic Logic.

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

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

[11]  Toniann Pitassi,et al.  Non-Automatizability of Bounded-Depth Frege Proofs , 1999, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317).

[12]  Maria Luisa Bonet,et al.  On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems , 2000, SIAM J. Comput..

[13]  Russell Impagliazzo,et al.  Using the Groebner basis algorithm to find proofs of unsatisfiability , 1996, STOC '96.