On the automatizability of resolution and related propositional proof systems

Information and Computation

Volumn 189, Issue 2, 2004, Pages 182-201

  Atserias, Albert ^a   Bonet, María Luisa ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Automatizability; Feasible interpolation; Propositional proof complexity; Reflection principles; Res(2); Resolution

Indexed keywords

ALGORITHMS; GRAPH THEORY; INTERPOLATION; POLYNOMIALS; PROBLEM SOLVING; THEOREM PROVING;

AUTOMATIZABILITY; FEASIBLE INTERPOLATION; PROPOSITIONAL PROOF COMPLEXITY; REFLECTION PRINCIPLES; RES(2); RESOLUTION;

COMPUTATIONAL COMPLEXITY;

EID: 1642619525     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ic.2003.10.004     Document Type: Article

References (31)

1. N. Alon, R.B. Boppana, The monotone circuit complexity of boolean functions, Combinatorica 7 (1987) 1-22.
2. A. Atserias, M.L. Bonet, J.L. Esteban, Lower bounds for teh weak pigeonhole principle and random formulas beyond resoultion, Information and Computaion 176 (2) (2002) 136-152. (A preliminary version appeared in ICALP'01.)
3. M. Alekhnovich, S. Buss, S. Moran, T. Pitassi, Minimum propositional proof length is NP-hard to linearly approximate, Journal of Symbolic Logic 66 (2001) 171-191.
4. M. Alekhnovich, A.A. Razborov, Resolution is not automatizable unless W[P] is tractable, in: 42nd Annual IEEE Symposium on Foundations of Computer Science, 2001, pp. 210-219.
5. M.L. Bonet, C. Domingo, R. Gavaldà, A. Maciel, T.Pitassi, Non-automatizability of bounded-depth Frege proofs, in: 14th IEEE Conference on Computational Complexity, pp. 15-23, 1999. Journal of Computational Complexity (accepted).
6. M.L. Bonet, J.L. Esteban, N. Galesi, J. Johansen, On the relative complexity of resolution refinements and cutting planes proof systems, SIAM Journal of Computing 30 (5) (2000) 1462-1484. (A preliminary version appeared in FOCS'98.)
7. M.L. Bonet, N. Galesi, Optimality of size-width trade-offs for resolution, Computational Complexity 10 (4) (2001) 261-276. (A preliminary version appeared in FOCS'99.)
8. P. Beame, T. Pitassi, Simplified and improved resolution lower bounds, in: 37th Annual IEEE Symposium on Foundations of Computer Science, 1996, pp. 274-282.
9. M.L. Bonet, T. Pitassi, R. Raz, Lower bounds for cutting planes proofs with small coefficients, Journal of Symbolic Logic 62 (3) (1997) 708-728. (A preliminary version appeared in STOC'95.)
10. M.L. Bonet, T. Pitassi, R. Raz, On interpolation and automatization for Frege systems, SIAM Journal of Computing 29 (6) (2000) 1939-1967. (A preliminary version appeared in FOCS'97.)
11. E. Ben-Sasson, R. Impagliazzo, A. Wigderson, Near-optimal separation of general and tree-like resolution. Combinatorica, 2002 (to appear).
12. E. Ben-Sasson, A. Wigderson, Short proofs are narrow-resolution made simple, Journal of the ACM 48 (2) (2001) 149-169.
13. S.A. Cook, A. Haken, An exponential lower bound for the size of monotone real circuits, Journal of Computer and System Sciences 58 (1999) 326-335.
14. S. Cook, R. Reckhow, The relative efficiency of propositional proof systems, Journal of Symbolic Logic 44 (1979) 36-50.
15. M. Davis, G. Logemann, D. Loveland, A machine program for theorem proving, Communications of the ACM 5 (1962) 394-397.
16. M. Davis, H. Putnam, A computing procedure for quantification theory, Journal of the ACM 7 (1960) 201-215.
17. J.L. Esteban, N. Galesi, J. Messner, On the complexity of resolution with bounded conjunctions, in: 29th International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science, vol. 2380, Springer-Verlag, 2002, pp. 220-231.
18. R. Impagliazzo, T. Pitassi, A. Urquhart, Upper and lower bounds for tree-like cutting planes proofs, in: 9th IEEE Symposium on Logic in Computer Science, 1994, pp. 220-228.
19. 1 and EF, Information and Computation 140 (1) (1998) 82-94.
20. J. Krajícek, Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic, Journal of Symbolic Logic 62 (1997) 457-486.
21. J. Krajícek, On methods for proving lower bounds in propositional logic, in: Logic and Scientific Methods, Kluwer Academic Publishers, 1997, pp. 69-83.
22. J. Krajícek, On the weak pigeonhole principle, Fundamenta Mathematicæ 170 (1-3) (2001) 123-140.
23. A. Maciel, T. Pitassi, A.R. Woods, A new proof of the weak pigeonhole principle, Journal of Computer and Systems Science 64 (2002) 843-872.
24. P. Pudlák, J. Sgall, Algebraic models of computation and interpolation for algebraic proof systems, in: P.W. Beame, S.R. Buss (Eds.), Proof Complexity and Feasible Arithmetic, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 39, American Mathematical Society, 1998, pp. 279-296.
25. P. Pudlák, Lower bounds for resolution and cutting plane proofs and monotone computations, Journal of Symbolic Logic 62 (3) (1997) 981-998.
26. P. Pudlák, On the complexity of the propositional calculus, in: Sets and Proofs, Invited Papers from Logic Colloquium '97. Cambridge University Press, 1999, pp. 197-218.
27. P. Pudlák, On reducibility and symmetry of disjoint NP-pairs, in: 26th International Symposium on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, Springer-Verlag, 2001, pp. 621-632.
28. P. Pudlák, On reducibility and symmetry of disjoint NP-pairs, Theoretical Computer Science 295 (2003) 323-339.
29. A.A. Razborov, On provably disjoint NP-pairs, Technical Report RS-94-36, BRICS, 1994.
30. A.A. Razborov, Unprovability of lower bounds on circuit size in certain fragments of bounded arithmetic, Izvestiya of the RAN 59 (1) (1995) 205-227.
31. N. Segerlind, S. Buss, R. Impagliazzo, A switching lemma for small restrictions and lower bounds for k-DNF resolution, in: 43rd Annual IEEE Symposium on Foundations of Computer Scienc, 2002, pp. 604-614.