Abstract
It is constructively shown that there is a common improvement of both proof procedures and refutation procedures.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Bibel, W.: An approach to a systematic theorem proving procedure in first-order logic. Computing 12, 43–55 (1974).
Bibel, W.: Effizienzvergleiche von Beweisprozeduren. GI '74, Lect. Notes Comp. Sci. 26, 153–160 (1975).
Bibel, W. and Schreiber, J.: Proof search in a Gentzen-like system of first-order logic. Proc. Int. Comp. Symp. (ICS'75), North-Holland, 205–212 (1975).
Bibel, W.: Maschinelles Beweisen. Jahrbuch Überblicke Mathematik, B. Fuchssteiner, U. Kulisch, D. Langwitz, R. Liedl (eds.), BI Wissenschaftsverlag, 115–142 (1976).
Bledsoe, W.W. and Tyson, M.: The U.T. Interactive Prover. Memo ATP-17, Math. Dept., Univ. Texas, Austin (1975).
Chang, C.-L. and Lee, R.C.-T.: Symbolic Logic and mechanical theorem proving. Academic Press (1973).
Joyner, W.H., Jr.: A resolution analogue to the Herbrand theorem. Presented at the conference on Automatic Theorem Proving, Oberwolfach (1976).
Overbeek, R.: An approach to the implementation of theorem proving systems. Presented at the conference on Automatic Theorem Proving, Oberwolfach (1976).
Rights and permissions
Copyright information
© 1977 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bibel, W. (1977). A syntactic connection between proof procedures and refutation procedures. In: Theoretical Computer Science. Lecture Notes in Computer Science, vol 48. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08138-0_19
Download citation
DOI: https://doi.org/10.1007/3-540-08138-0_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08138-8
Online ISBN: 978-3-540-37389-6
eBook Packages: Springer Book Archive