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. R. S. Boyer, Locking: a restriction of resolution, Ph.D. Thesis, Univ. of Texas at Austin 1971.
3. Lawrence Henschen, R. Overbeek, and Lawrence Wos, “Hyperparamodulation: a refinement of paramodulation,” in Proceedings of the Fifth Conference an Automated Deduction, Springer-Verlag Lecture Notes in Computer Science, v. 87, ed. Robert Kowalski and Wolfgang Bibel, (July 1960).
4. 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).
5. E. Lusk and R. Overbeek, Standardizing the external format of formulas, (preprint). September 1980.