Abstract
This paper gives an overview over the connection method in Automated Theorem Proving, developed earlier by the author. Its prominent features are illustrated with a number of examples. These features provide it with provable advantages over any standard proof method. Some of them also have been obtained by Andrews in an independent approach using matings. The relationship between these two methods is clarified.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
P.B. Andrews, Theorem Proving via General Matings, Journal of the ACM (to appear).
P.B. Andrews, Transforming matings into natural deduction proofs, Proc 5th Conf. on Autom. Deduction (W. Bibel, R. Kowalski, eds.), LN in Comp. Sc. 87 (Springer, Berlin, 1980), 281–292.
W. Bibel, On matrices with connections, Journal of the ACM (to appear).
W. Bibel, A comparative study of several proof procedures, Artificial Intelligence Journal (to appear).
W. Bibel, The complete theoretical basis for the systematic proof method, Bericht ATP-6-XII-80, Institut für Informatik, TUM (1980). Submitted to Journal of the ACM.
W. Bibel, Automated theorem proving (book in preparation to appear in Vieweg Verlag, Wiesbaden) .
W. Bibel, Syntax-directed, semantics-supported program synthesis, Artificial Intelligence Journal 14 (1980) 243–261.
W. Bibel and R. Kowalski (eds.), 5th Conference on Automated Deduction, LN in Computer Sc. 87 (Springer, Berlin, 1980).
W.W. Bledsoe, Non-resolution theorem proving, Artificial Intelligence 9 (1977) 1–35.
C.-L. Chang and R.C.-T. Lee, Symbolic logic and mechanical theorem proving (Academic Press, New York, 1973).
G. Gentzen, Untersuchungen über das logische Schließen I, Mathemat. Zeitschrift 39, (1935) 176–210.
J. Herbrand, Recherches sur la Theorie de la Demonstration, Traveaux de la Sosieté des Sciences et des Lettres de Varsovie, Classe III sciences mathematiques et physiques, 33 (1930).
W. Joyner (ed.), 4th Workshop on Automated Deduction (Austin, Texas, 1979).
D.W. Loveland, Automated theorem proving (North Holland, Amsterdam, 1978).
N.J. Nilsson, Principles of artificial intelligence (Tioga, Palo Alto, 1980).
J.A. Robinson, Logic: form and function, Edinburgh University Press (1979).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bibel, W. (1981). Matings in Matrices. In: Siekmann, J.H. (eds) GWAI-81. Informatik-Fachberichte, vol 47. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-02328-0_16
Download citation
DOI: https://doi.org/10.1007/978-3-662-02328-0_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10859-7
Online ISBN: 978-3-662-02328-0
eBook Packages: Springer Book Archive