Author:
Siekmann Jörg,Wrightson Graham
Publisher
Springer Berlin Heidelberg
Reference58 articles.
1. Andrews, P. B.: Resolution with Merging. J. ACM 15 (1968) 367–381.
2. Andrews, P. B.: Refutations by Matings. IEEE Trans. Comp. C-25, (1976) 8, 801–807.
3. Andrews, P.B.: Theorem Proving via General Matings. J. ACM 28 (1981) 193–214.
4. Antoniuo, G., Ohlbach, H.J.: Terminator. Proceedings 8th IJCAI, Karlsruhe, (1983) 916–919.
5. Bibel, W.: A Strong Completeness Result for the Connection Graph Proof Procedure. Bericht ATP-3-IV-80, Institut für Informatik, Technische Universität, München (1980)