Abstract
We give a brief overview of the first-order classical logic component in the Gandalf family of resolution-based automated theorem provers for classical and intuitionistic logics. The main strength of the described version is a sophisticated algorithm for nonunit subsumption.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Fermüller, C., Leitsch, A., Tammet, T. and Zamov, N.: Resolution Methods for Decision Problems, Lecture Notes in Artificial Intelligence 679, Springer-Verlag, 1993.
Magnusson, L. and Nordström, B.: The ALF proof editor and its proof engine, in Types for Proofs and Programs, Lecture Notes in Computer Science 806, Springer-Verlag, 1994, pp. 213–237.
Tammet, T.: Completeness of resolution for definite answers, Journal of Logic and Computation 4(5) (1995), 449–471.
Tammet, T.: A resolution theorem prover for intuitionistic logic, in CADE-13, Lecture Notes in Computer Science 1104, Springer-Verlag, 1996, pp. 2–16.
Tammet, T. and Smith, J.: Optimised encodings of fragments of type theory in first order logic, in Types for Proofs and Programs, Lecture Notes in Computer Science 1158, Springer-Verlag, 1996, pp. 265–287.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Tammet, T. Gandalf. Journal of Automated Reasoning 18, 199–204 (1997). https://doi.org/10.1023/A:1005887414560
Issue Date:
DOI: https://doi.org/10.1023/A:1005887414560