The complexity of resolution refinements

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2003, Pages 138-147

  Buresh Oppenheim, Joshua ^a   Pitassi, Toniann ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTER SIMULATION; SEMANTICS; TREES (MATHEMATICS); ALGORITHMS; TESTING;

SEMANTIC RESOLUTION;

THEOREM PROVING; SEPARATION;

LOGIC; RELATIVE COMPLEXITY;

EID: 0042969223     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (24)

1. M. Alekhnovich, J. Johannsen, T. Pitassi, and A. Urquhart. An exponential separation between regular and general resolution. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC-02), pages 448-456, New York, May 19-21 2002. ACM Press.
2. E. Ben-Sasson. Size space tradeoffs for resolution. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC-02), pages 457-464, New York, May 19-21 2002. ACM Press.
3. [3] E. Ben-Sasson and A. Wigderson. Short proofs are narrow - resolution made simple. In Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, pages 517-526, Atlanta, GA, May 1999.
4. M. Bonet, J. L. Esteban, N. Galesi, and J. Johannsen. Exponential separations between restricted resolution and cutting planes proof systems. In Proceedings from 38th FOCS, pages 638-647, 1998.
5. M. Bonet and N. Galesi. A study of proof search algorithms for resolution and polynomial calculus. 1999.
6. J. Buresh-Oppenheim, M. Clegg, R. Impagliazzo, and T. Pitassi. Homogenization and the polynomial calculus. In 27th International Colloquium on Automata, Languages and Programming, pages 926-937, 2000.
7. S. A. Cook. An observation on time-storage trade off. In Conference Record of Fifth Annual ACM Symposium on Theory of Computing, pages 29-33, Austin, TX, Apr.-May 1973.
8. M. Davis, G. Logemann, and D. Loveland. A machine program for theorem proving. Communications of the ACM, 5:394-397, 1962.
9. M. Davis and H. Putnam. A computing procedure for quantification theory. Communications of the ACM, 7:201-215, 1960.
10. U. Dunker. Zur Effizienz der Beweissuche in der Logikverarbeitung. PhD thesis, Universität Paderborn, 1997.
11. A. Goerdt. Davis-Putnam resolution versus unrestricted resolution. Annals of Mathematics and Artificial Intelligence, 6:169-184, 1992.
12. A. Goerdt. Unrestricted resolution versus n-resolution. Theoretical Computer Science, 93:159-167, 1992.
13. A. Goerdt. Regular resolution versus unrestricted resolution. SIAM Journal on Computing, 22(4):661-683, 1993.
14. A. Haken. The intractability of resolution. Theoretical Computer Science, 39:297-305, 1985.
15. J. Johannsen. Exponential incomparability of tree-like and ordered resolution. 2001.
16. R. Kowalski and D. Kuehner. Linear resolution with selection function. Artificial Intelligence, 2:227-260.
17. D. Kozen. Lower bounds for natural proof systems. In 18th Annual Symposium on Foundations of Computer Science, pages 254-266.
18. B. Krishnamurthy. Short proofs for tricky formulas. Acta Informatica, 22:253-275, 1985.
19. W. J. Paul, R. E. Tarjan, and J. R. Celoni. Space bounds for a game on graphs. Mathematical Systems Theory, 10(3):239-251, 1977. Correction, ibid. 11(1):85, 1977.
20. R. Raz and P. McKenzie. Separation of the monotone nc hierarchy. In Proceedings of 37th IEEE Foundations of Computer Science, 1997.
21. J. A. Robinson. A machine oriented logic based on the resolution principle. Journal of the ACM, 12(1):23-41, 1965.
22. G. S. Tseitin. On the complexity of derivation in the prepositional calculus. In A. O. Slisenko, editor, Studies in Constructive Mathematics and Mathematical Logic, Part II. 1968.
23. A. Urquhart. The complexity of prepositional proofs. Bulletin of Symbolic Logic, 1(4):425-467, Dec. 1995.
24. A. Vellino. The Complexity of Automated Reasoning. PhD thesis, University of Toronto, 1989.