1. Andrews, P. B. Resolution with merging. J. ACM
15, 3 (July 1968), 367–381.
2. Davis, M., and Putnam, H. A computing procedure for quantification theory. J. ACM 7, 3 (July 1960), 201–215.
3. Lee, C. T. A completeness theorem and a computer program for finding theorems derivable from given axioms. Ph.D. dins., Dep. of Elec. Eng. and Computer Sci., U. of Calif., Berkeley, 1967.
4. Loveland, D. W. A linear format for resolution. Carnegie-Mellon U., Pittsburgh, Pa., Dec. 1968.
5. Luckham, D. Some tree-paring strategies for theorem-proving. In Machine Intelligence, Vol. 3 (Dale, E., and Michie, D., eds.), Oliver & Boyd, Edinburgh, 1968, pp. 95–112.