On the complexity of resolution with bounded conjunctions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2380 LNCS, Issue , 2002, Pages 220-231

  Esteban, Juan Luis ^a   Galesi, Nicola ^a,b   Messner, Jochen ^c  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b UNIVERSITY OF TORONTO   (Canada)

^c UNIVERSITY OF ULM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY;

LITERALS; LOWER BOUNDS; OPTIMAL SPACE; PROOF SYSTEM; RANDOM FORMULAS; SPACE COMPLEXITY;

FORESTRY;

EID: 3242721692     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45465-9_20     Document Type: Conference Paper

References (25)

1. M. Alekhnovich, E. Ben-Sasson, A. Razborov, A. Wigderson. Space complexity in propositional calculus.STOC 2000 pp. 358-367. To appear in SIAM J. Comput.
2. M. Alekhnovich, A. Razborov.Resolution is not automatizable unless W[P] is not tractable.FOCS 2001. pp.190-199.
3. A. Atserias, M. L. Bonet.On the automatizability of Resolution and related propositional proof systems. TR02-010, ECCC, 2002.
4. A. Atserias, M.L. Bonet, J.L. Esteban. Lower Bounds for the Weak Pigeonhole Principle Beyond Resolution. ICALP 2001, pp. 1005-1016.
5. P. Beame, T. Pitassi. Simplified and Improved Resolution Lower Bounds. FOCS 1996, pp. 274-282.
6. E. Ben-Sasson. Size-Space tradeoffs for Resolution. To appear in,STOC 2002.
7. E. Ben-Sasson, N. Galesi. Space Complexity of Random Formulae in Resolution. CCC 2001, pp. 42-51.
8. E. Ben-Sasson, R. Impagliazzo, A. Wigderson. Near optimal separation of treelike and general Resolution. TR00-005, ECCC, 2000.
9. E. Ben-Sasson, A. Wigderson. Short Proofs Are Narrow - Resolution Made Simple. J. ACM 48(2) pp. 149-168, 2001.
10. M.L. Bonet, J.L. Esteban, N. Galesi, J. Johannsen. On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems. SIAM J. Comput. 30(5) pp. 1462-1484, 2000.
11. P. Beame, R.M. Karp, T. Pitassi, M.E. Saks.On the Complexity of Unsatisfiability Proofs for Random k-CNF Formulas.STOC 1998, pp. 561-571.
12. M.L. Bonet, T. Pitassi, R. Raz On Interpolation and Automatization for Frege Systems.SIAM J. Comput. 29(6) pp. 1939-1967, 2000.
13. S. Cook, R. Reckhow. The relative efficiency of propositional proof systems. J. Symbolic Logic 44 pp. 36-50, 1979.
14. J.L. Esteban, J. Torán.Space bounds for resolution. Inform. and Comput. 171 (1) pp. 84-97, 2001.
15. A. Haken.The Intractability of Resolution.Theoret. Comp. Sci. 39, 297-308, 1985.
16. J. Krajíček. On the weak pigeonhole principle. Fund. Math. 170(1-3) pp. 123-140, 2001.
17. J. Krajíček. Lower Bounds to the Size of Constant-Depth Propositional Proofs. J. Symbolic Logic 59(1) pp. 73-86, 1994.
18. 1 and EF.Inform. and Comput. 140(1) pp. 82-94, 1998.
19. A. Maciel, T. Pitassi, A.R. Woods. A new proof of the weak pigeonhole principle. STOC 2000 pp. 368-377.
20. W.J. Paul, R.E. Tarjan, J.R. Celoni. Space bounds for a game on graphs. Math. Systems Theory, 10 pp. 239-251, 1977.
21. P. Pudlák, R. Impagliazzo. Lower bounds for DLL algorithms. SODA 2000 pp. 128-136.
22. R. Raz. Resolution Lower Bounds for the Weak Pigeonhole Principle. TR01-21. ECCC, 2001.
23. A. Razborov.Resolution Lower Bounds for Perfect Matching Principles.MS, 2001.
24. G.S. Tseitin. On the complexity of derivation in propositional calculus. Studies in Constructive Mathematics and Mathematical Logic, Part 2. pp. 115-125. Consultants Bureau, New York-London, 1968.
25. A. Urquhart.Hard examples for resolution. J. ACM 34(1) pp. 209-219, 1987.