Many Hard Examples for Resolution

Journal of the ACM (JACM)

Volumn 35, Issue 4, 1988, Pages 759-768

  Chvátal, Vašek ^a   Szemerédi, Endre ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

Resolution; satisfrability

Indexed keywords

MATHEMATICAL TECHNIQUES - GRAPH THEORY; PROBABILITY - RANDOM PROCESSES;

RANDOM HYPERGRAPHS; RESOLUTION; SATISFIABILITY;

ARTIFICIAL INTELLIGENCE;

EID: 0024090265     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/48014.48016     Document Type: Article

References (18)

1. Bibel, W. Automated Theorem Proving, 2nd ed. Vieweg, Braunschweig, 1987.
2. Blake, A. Canonical Expressions in Boolean algebra. Ph.D. dissertation. Univ. of Chicago, Chicago, III., 1937.
3. Chvátal, V. Probabilistic methods in graph theory. Ann. Oper. Res. 1 (1984), 171-182.
4. Cook, S. A. The complexity of theorem-proving procedures. In Proceedings of the 3rd Annual Symposium on the Theory of Computing (Shaker Heights, Ohio, May 3-7). ACM, New York, 1971, pp. 151-158.
5. Davis, M., and Putnam, H. A computing procedure for quantification theory. J. ACM 7, 3 (July 1960), 201-215.
6. Galil, Z. On the complexity of regular resolution and the Davis-Putnam procedure. Theoret. Compul. Sci. 4 (1977), 23-46.
7. Haken, A. The intractability of resolution. Theoret. Comput. Sci. 39 (1985), 297-308.
8. Hall, P. On representatives of subsets. J. London Math. Soc. 10 (1935), 26-30.
9. Hammer (Ivanescu), P. L., and Rudeanu, S. Boolean Methods in Operations Research and Related Areas. Springer- Verlag, Berlin, Heidelberg, New York, 1968.
10. Hoffman, A. J., and Kuhn, H. W. On systems of distinct representatives. In Linear Inequalities and Related Systems. Annals of Mathematical Studies, vol. 38. Princeton University Press, Princeton, N.J., 1956, pp. 199-206.
11. Löwenheim, L. Über das Aufiösungsproblem im logischen Klassenkalkul. Sitzungsber. Berlin Math.Ges. 7(1908), 89-94.
12. Löwenheim, L. Über die Auflösung von Gleichungen im logischen Gebietkalkul. Math. Ann. 68 (1910), 169-207.
13. Lowenheim, L. Über Transformationen im Gebietkalkul. Math. Ann. 73 (1913), 245-272.
14. Rado, R. A theorem on independence relations. Quart. J. Math. (Oxford) 13 (1942), 83-89.
15. Robinson, J. A. A machine-oriented logic based on the resolution principle. J. ACM 12, 1 (Jan. 1965), 23-41.
16. Tseitin, G. S. On the complexity of derivations in the prepositional calculus. In Studies in Constructive Mathematics and Mathematical Logic, Part 2. Consultants Bureau, New York-London, 1968, pp. 115-125.
17. Urquhart, A. Hard examples for resolution. J. ACM 34, 1 (Jan. 1987), 209-219.
18. Welsh, D. J. A. Some applications of a theorem of Rado. Mathematika 15 (1968), 199-203.