Abstract
A new proof search method for the first order logic based on Gentzen-like calculus is presented. Neither conjunctive nor disjunctive normal forms are used. Soundness and completeness of some strategies are proved. The method essentially uses the general ideas of Maslov's inverse method [8].
Preview
Unable to display preview. Download preview PDF.
References
Andrews P.B.: Theorem proving via general matings. J.Assoc. Comp. Math. 2(1981), v.28, 193–214
Bibel W.: Automated theorem proving. Vieweg Verlag, (1982)
de Champeaux D.: Sub-problem finder and instance checker: two cooperating preprocessors for theorem-provers. 6th IJCAI, (1981), v.1, 191–196
Chang C., Lee R.C.: Symbolic logic and mechanical theorem proving. Academic Press, (1973)
Dragalin A.: A proof-search method. Proc. 8th Int. Congress on Logic, Methodology and Philosophy of Sci. Moscow, (1987)
Gentzen G.: Untersuchungen uber das logishe Schliessen. Math. Z. (1935), v.39, 176–210; 405–431
Loveland D.: Automated theorem proving: a logical basis. North Holland, (1978)
Maslov S.Y.: Inverse method of establishing deducibility for logical calculi. Trudy Math. Inst. (1968), v.98
Schutte K.: Beweistheorie. Springer Verlag, (1960)
Stickel M.: A Prolog technology theorem prover. 8th International Conf. on Automated Deduction, Lecture Notes in Comput. Sci. (1986), v.230
Voronkov A.A.: A proof search method. Vychislitelnye sistemy, Novosibirsk, (1985), v.107, 109–124 (in Russian)
Voronkov, A.A.: Degtjarev A.I.: Automated theorem proving I, II. Kibernetika, (1986), v.3, (1987) v.4 (In Russian)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Voronkov, A.A. (1990). A proof-search method for the first order logic. In: Martin-Löf, P., Mints, G. (eds) COLOG-88. COLOG 1988. Lecture Notes in Computer Science, vol 417. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52335-9_63
Download citation
DOI: https://doi.org/10.1007/3-540-52335-9_63
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52335-2
Online ISBN: 978-3-540-46963-6
eBook Packages: Springer Book Archive