1. Peter B. Andrews (1981): Theorem Proving via General. Matings. Journal of the ACM 28, 193–214.
2. Peter B. Andrews (1989): On Connections and Higher-order Logic. Journal of Automated Reasoning 5, 257–291.
3. W. Bibel and E. Eder (1990). Methods and Calculi for Deduction. In: D. M. Gabbay, C. J. Hogger, and J. A. Robinson, eds.: Handbook of Logic in Artificial Intelligence and Logic Programming. Oxford: Oxford University Press, to appear.
4. W. Bibel (1974): An Approach to a Systematic Theorem Proving Procedure in First-order Logic. Computing 12, 43–55. First presented to the GI Annual Conference in 1971.
5. W. Bibel (1980): A Strong Completeness Result for the Connection Graph Proof Procedure. Technical Report ATP-3-IV-80, FG Kunstfiche Intelligenz, Technische Universitat Miinchen, Munich, Germany.