Abstract
We use the general scheme of building resolution calculi (also called the inverse method) originating from S.Maslov and G.Mints to design and implement a resolution theorem prover for intuitionistic logic. A number of search strategies are introduced and proved complete. The resolution method is shown to be a decision procedure for a new syntactically described decidable class of intuitionistic logic. The performance of our prover is compared with the performance of a tableau prover for intuitionistic logic presented in [12], using both the benchmarks from the latter and the theorems from J. von Plato-s constructive geometry [9].
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Beeson, M.J., Some applications of Gentzen's proof theory in automated deduction. Manuscript, 1988.
Chang, C.L., Lee, R.C.T. Symbolic Logic and Mechanical Theorem Proving. Academic Press, (1973).
Dyckoff, R. Contraction-free sequent calculi for intuitionistic logic. Journal of Symbolic Logic, 57(3), 795–807 (1992).
Fermüller, C., Leitsch, A., Tammet, T., Zamov, N. Resolution methods for decision problems. LNCS 679, Springer Verlag, (1993).
Fitting, M. Resolution for Intuitionistic Logic. Paper presented at ISMIS '87, Charlotte, NC. 1987.
S.Ju.Maslov An inverse method of establishing deducibility in the classical predicate calculus. Dokl. Akad. Nauk. SSSR 159 (1964) 17–20=Soviet Math. Dokl. 5 (1964) 1420, MR 30 #3005.
G.Mints. Gentzen-type Systems and Resolution Rules. Part I. Propositional Logic. In COLOG-88, pages 198–231, LNCS 417, Springer-Verlag, 1990.
G.Mints. Resolution Strategies for the Intuitionistic Logic. In Constraint Programming, NATO ASI Series F, v. 131, pp. 289–311, Springer Verlag, (1994).
J. von Plato. The Axioms of Constructive Geometry. Annals of Pure and Applied Logic 76(2), 169–200 (1995).
Pym, D.J., Wallen, L.A. Investigations into proof-search in a system of first-order dependent function types. In CADE-10, pages 236–250, Springer Verlag 1990.
J.A. Robinson. A Machine-oriented Logic Based on the Resolution Principle. Journal of the ACM 12, 23–41 (1965).
D.Sahlin, T.Franzen, S.Haridi. An Intuitionistic Predicate Logic Theorem Prover. Journal of Logic and Computation, 2(5), 619–656 (1992).
N.Shankar. Proof Search in the Intuitionistic Sequent Calculus. In CADE-11, pages 522–536, LNCS 607, Springer Verlag, (1992).
T.Tammet. Proof Strategies in Linear Logic. Journal of Automated Reasoning 12(3), 273–304 (1994).
Tammet, T., Smith, J. Optimised Encodings of Fragments of Type Theory in First Order Logic. In Proceedings of the CADE-12 workshop on proof search in type-theoretic languages, Nancy 1994, 87–93.
Voronkov, A. Theorem proving in non-standard logics based on the inverse method. In CADE-11, pages 648–662, LNCS 607, Springer Verlag, (1992).
Volozh, B., Matskin, M., Mints, G., Tyugu, E. PRIZ system and the Propositional Calculus. Kibernetika and Software 6, (1983).
Wallen, L.A. Automated Proof Search in Non-Classical Logics. MIT Press, (1990).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tammet, T. (1996). A resolution theorem prover for intuitionistic logic. In: McRobbie, M.A., Slaney, J.K. (eds) Automated Deduction — Cade-13. CADE 1996. Lecture Notes in Computer Science, vol 1104. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61511-3_65
Download citation
DOI: https://doi.org/10.1007/3-540-61511-3_65
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61511-8
Online ISBN: 978-3-540-68687-3
eBook Packages: Springer Book Archive