1. W. W. Bledsoe and Larry M. Hines, “Variable elimination and chaining in a resolution-based prover for inequalities,” in Proceedings of the Fifth Conference on Automated Deduction, Springer-Verlag Lecture Notes in Computer Science, v. 87, ed. Robert Kowalski and Wolfgang Bibel, (July 1980).
2. E. Lusk, William McCune, and R. Overbeek, Logic machine architecture: kernel functions, preprint.
3. E. Lusk and R. Overbeek, “Data structures and control architecture for the implementation of theorem-proving programs,” in Proceedings of the Fifth Conference on Automated Deduction, Springer-Verlag Lecture Notes in Computer Science, v. 87, ed. Robert Kowalski and Wolfgang Bibel, (1980).
4. J. McCharen, R. Overbeek, and L. Wos, “Complexity and related enhancements for automated theorem-proving programs,” Computers and Mathematics with Applications 2 pp. 1–16 (1976).
5. William W. McCune, An inference mechanism far resolution-style theorem provers. Master's Thesis, Northwestern University 1981.