A study of proof search algorithms for resolution and polynomial calculus

The paper is concerned with the complexity of proofs and of searching for proofs in two propositional proof systems: Resolution and Polynomial Calculus (PC). For the former system we show that the recently proposed algorithm of E. Ben-Sasson and A. Wigderson (1999) for searching for proofs cannot give better than weakly exponential performance. This is a consequence of showing optimality of their general relationship, referred to as size-width trade-off. We moreover obtain the optimality of the size width trade-off for the widely used restrictions of resolution: regular, Davis-Putnam, negative, positive and linear. As for the second system, we show that the direct translation to polynomials of a CNF formula having short resolution proofs, cannot be refuted in PC with degree less than /spl Omega/ (log n). A consequence of this is that the simulation of resolution by PC of M. Clegg, J. Edmonds and R. Impagliazzo (1996) cannot be improved to better than quasipolynomial in the case where we start with small resolution proofs. We conjecture that the simulation of M. Clegg et al. is optimal.

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

[2]  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).

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

[4]  Andreas Goerdt,et al.  Unrestricted Resolution versus N-Resolution , 1990, MFCS.

[5]  Samuel R. Buss,et al.  Resolution and the Weak Pigeonhole Principle , 1997, CSL.

[6]  Eli Ben-Sasson,et al.  Short proofs are narrow-resolution made simple , 1999, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317).

[7]  Russell Impagliazzo,et al.  Lower bounds for the polynomial calculus and the Gröbner basis algorithm , 1999, computational complexity.

[8]  Andreas Goerdt.  Unrestricted Resolution versus N-Resolution , 1992, Theor. Comput. Sci..

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

[10]  Richard Statman,et al.  Logic for computer scientists , 1989 .

[11]  Samuel R. Buss,et al.  Linear gaps between degrees for the polynomial calculus modulo distinct primes , 1999, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317).

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

[13]  Maria Luisa Bonet,et al.  Exponential separations between restricted resolution and cutting planes proof systems , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[14]  Jan Krajícek,et al.  Some Consequences of Cryptographical Conjectures for S_2^1 and EF , 1994, LCC.

[15]  Ran Raz,et al.  No feasible interpolation for TC/sup 0/-Frege proofs , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

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

[17]  Alexander A. Razborov,et al.  Lower bounds for the polynomial calculus , 1998, computational complexity.