E - a brainiac theorem prover

  • Authors:
  • Stephan Schulz

  • Affiliations:
  • Institut für Informatik, Technische Universität München, 80290 München, Germany E-mail: schulz@informatik.tu-muenchen.de

  • Venue:
  • AI Communications - CASC
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

We describe the superposition-based theorem prover E. E is a sound and complete prover for clausal first order logic with equality. Important properties of the prover include strong redundancy elimination criteria, the DISCOUNT loop proof procedure, a very flexible interface for specifying search control heuristics, and an efficient inference engine. We also discuss strength and weaknesses of the system.