Cuting Plane Versus Frege Proof Systems

The cutting plane proof system for proving the unsatisfiability of propositional formulas in conjunctive normalform is based on a natural representation of formulas as systems of integer inequalities. We show: Frege proof systems p-simulate the cutting plane proof system. This strengthens a result in [5], that extended Frege proof systems (which are believed to be stronger than Frege proof systems) p-simulate the cutting plane proof system. Our proof is based on the techniques introduced in [2].

[1]  R. Smullyan.  First-Order Logic , 1968 .

[2]  Samuel R. Buss.  Polynomial Size Proofs of the Propositional Pigeonhole Principle , 1987, J. Symb. Log..

[3]  Dyneley Hussey,et al.  Annals of Opera , 1943 .

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

[5]  John N. Hooker,et al.  Generalized resolution and cutting planes , 1988 .

[6]  Miklós Ajtai,et al.  The complexity of the Pigeonhole Principle , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[7]  Richard C. T. Lee,et al.  Symbolic logic and mechanical theorem proving , 1973, Computer science classics.

[8]  Pavel Pudlák,et al.  Ramsey's Theorem in Bounded Arithmetic , 1990, CSL.

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

[10]  Peter Clote,et al.  Bounded arithmetic and computational complexity , 1990, Proceedings Fifth Annual Structure in Complexity Theory Conference.

[11]  William J. Cook,et al.  On the complexity of cutting-plane proofs , 1987, Discret. Appl. Math..