Advertisement

Journal of Automated Reasoning

, Volume 18, Issue 2, pp 199–204 | Cite as

Gandalf

  • Tanel Tammet
Article

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.

automated theorem proving competition Gandalf resolution subsumption 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Fermüller, C., Leitsch, A., Tammet, T. and Zamov, N.: Resolution Methods for Decision Problems, Lecture Notes in Artificial Intelligence 679, Springer-Verlag, 1993.Google Scholar
  2. 2.
    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.Google Scholar
  3. 3.
    Tammet, T.: Completeness of resolution for definite answers, Journal of Logic and Computation 4(5) (1995), 449–471.Google Scholar
  4. 4.
    Tammet, T.: A resolution theorem prover for intuitionistic logic, in CADE-13, Lecture Notes in Computer Science 1104, Springer-Verlag, 1996, pp. 2–16.Google Scholar
  5. 5.
    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.Google Scholar

Copyright information

© Kluwer Academic Publishers 1997

Authors and Affiliations

  • Tanel Tammet
    • 1
  1. 1.Department of Computing ScienceUniversity of GöteborgGöteborgSweden

Personalised recommendations