Regular and general resolution: An improved separation

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

Volumn 4996 LNCS, Issue , 2008, Pages 277-290

  Urquhart, Alasdair ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION MAKING; PROBLEM SOLVING;

RESOLUTION REFUTATION;

SET THEORY;

EID: 44649165883     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-79719-7_26     Document Type: Conference Paper

References (15)

1. Tseitin, G.: On the complexity of derivation in propositional calculus. In: Slisenko, A.O. (ed.) Studies in Constructive Mathematics and Mathematical Logic, Part 2, pp. 115-125. Consultants Bureau, New York (1970); Reprinted in[15], vol. 2, pp. 466-483
2. Davis, M., Logemann, G., Loveland, D.: A machine program for theorem proving. Communications of the Association for Computing Machinery 5, 394-397 (1962); Reprinted in [15], vol. 1, pp. 267-270
3. Urquhart, A.: The complexity of propositional proofs. The Bulletin of Symbolic Logic 1, 425-467 (1995)
4. Huang, W., Yu, X.: A DNF without regular shortest consensus path. SIAM Journal on Computing 16, 836-840 (1987)
5. Goerdt, A.: Regular resolution versus unrestricted resolution. SIAM Journal on Computing 22, 661-683 (1993)
6. Alekhnovich, M., Johannsen, J., Pitassi, T., Urquhart, A.: An exponential separation between regular and general resolution. Theory of Computing 3, 81-102 (2007); Preliminary version. In: Proceedings of the 34th Annual ACM Symposium on Theory of Computing, May 19-21, 2002, Montré al, Qué bec, Canada (2002)
7. Ben-Sasson, E., Impagliazzo, R., Wigderson, A.: Near optimal separation of treelike and general resolution. Combinatorica, 585-603 (2004); Preliminary version, ECCC TR00-005 (2000)
8. Krishnamurthy, B.: Short proofs for tricky formulas. Acta Informatica 22, 253-275 (1985)
9. Stålmarck, G.: Short resolution proofs for a sequence of tricky formulas. Acta Informatica 33, 277-280 (1996)
10. Bonet, M.L., Galesi, N.: Optimality of size-width tradeoffs for resolution. Computational Complexity 10, 261-276 (2001); Preliminary version: Proceedings 40th FOCS (1999)
11. Ben-Sasson, E.: Size Space Tradeoffs For Resolution. In: Proceedings of the 34th ACM Symposium on the Theory of Computing, pp. 457-464 (2002)
12. Kamath, A., Motwani, R., Palem, K., Spirakis, P.: Tail bounds for occupancy and the satisfiability threshold conjecture. Random Structures and Algorithms 7, 59-80 (1995)
13. McDiarmid, C.: Concentration. In: Habib, M., McDiarmid, C., Ramirez-Alfonsin, J., Reed, B. (eds.) Probabilistic Methods for Algorithmic Discrete Mathematics, vol. 16, pp. 195-248. Springer, Heidelberg (1998); Algorithms and Combinatorics 16
14. Paul, W., Tarjan, R., Celoni, J.: Space bounds for a game on graphs. Mathematical Systems Theory 10, 239-251 (1977)
15. Siekmann, J., Wrightson, G. (eds.): Automation of Reasoning. Springer, New York (1983)