Gandalf

  • Authors:
  • Tanel Tammet

  • Affiliations:
  • Department of Computing Science, University of Göteborg, Göteborg, Sweden. e-mail: tammet@cs.chalmers.se

  • Venue:
  • Journal of Automated Reasoning
  • Year:
  • 1997

Quantified Score

Hi-index 0.00

Visualization

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.