Advertisement

System Description: Waldmeister — Improvements in Performance and Ease of Use

  • Thomas Hillenbrand
  • Andreas Jaeger
  • Bernd Löchner
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1632)

Abstract

Waldmeister is an automated theorem prover for unconditional equational logic. It is based on unfailing Knuth-Bendix completion [1]. During the rst stage of development the focus was on efficient rewriting by means of indexing and space saving techniques [2, 4]. In this paper we present two aspects of our recent work which aim at improving the system with respect to performance and ease of use. Section 2 describes a more powerful hypothesis handling. In Sect. 3 we investigate the control of the proof search and outline our current component of self-adaptation to the given proof problem.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    L. Bachmair, N. Dershowitz, and D.A. Plaisted. Completion without failure. In Resolution of Equations in Algebraic Structures, volume 2, pages 1–30. Academic Press, 1989.MathSciNetGoogle Scholar
  2. [2]
    A. Buch and Th. Hillenbrand. Waldmeister: development of a high performance completion-based theorem prover. SEKI-Report 96-01, Universität Kaiserslautern, 1996.Google Scholar
  3. [3]
    J. Denzinger and S. Schulz. Learning domain knowledge to improve theorem proving. In Proceedings of the 13th International Conference on Automated Deduction, volume 1104of LNAI, pages 76–62. Springer Verlag, 1996.Google Scholar
  4. [4]
    Th. Hillenbrand, A. Buch, R. Vogt, and B. Löchner. Waldmeister: High performance equational deduction. Journal of Automated Reasoning, 18(2):265–270, 1997.CrossRefGoogle Scholar
  5. [5]
    A. Jaeger. Anwendungen von Nachfolgermengen in Termersetzungssystemen. Projektarbeit, Universität Kaiserslautern, 1997. In German.Google Scholar
  6. [6]
    C.B. Suttner and G. Sutcliffe. The TPTP problem library (TPTP v2.2.0). Technical Report 99/02, Department of Computer Science, James Cook University, Townsville, Australia, 1999.Google Scholar
  7. [7]
    K.A. Zhevlakov, A.M. Slin’ko, I. P. Shestakov, and A.I. Shirshov. Rings that are nearly associative. Academic Press, New York, 1982. Translated from the Russian by H.F. Smith.zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Thomas Hillenbrand
    • 1
  • Andreas Jaeger
    • 1
  • Bernd Löchner
    • 1
  1. 1.Fachbereich InformatikUniversität KaiserslauternKaiserslauternGermany

Personalised recommendations