Journal of the ACM Bibliography
W.
Bibel and E. Eder.
Decomposition of tautologies into regular formulas and strong
completeness of connection-graph resolution. Journal of the
ACM, 44(2):320-344, March 1997.
[BibTeX entry]
Selected references
- Robert Anderson and W. W. Bledsoe. A linear format for resolution
with merging and a new technique for establishing completeness.
Journal of the ACM, 17(3):525-534, July 1970.
- Wolfgang Bibel. On matrices
with connections. Journal of the ACM, 28(4):633-645,
October 1981.
- Va\v{s}ek Chvátal and Endre Szemerédi. Many hard examples for
resolution. Journal of the ACM, 35(4):759-768, October
1988.
- Robert Kowalski. A proof
procedure using connection graphs. Journal of the ACM,
22(4):572-595, October 1975.
- J. A. Robinson. A
machine-oriented logic based on the resolution principle.
Journal of the ACM, 12(1):23-41, January 1965.
- Alasdair Urquhart. Hard
examples for resolution. Journal of the ACM,
34(1):209-219, January 1987.
Shortcuts: