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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
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.
A. Buch and Th. Hillenbrand. Waldmeister: development of a high performance completion-based theorem prover. SEKI-Report 96-01, Universität Kaiserslautern, 1996.
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.
Th. Hillenbrand, A. Buch, R. Vogt, and B. Löchner. Waldmeister: High performance equational deduction. Journal of Automated Reasoning, 18(2):265–270, 1997.
A. Jaeger. Anwendungen von Nachfolgermengen in Termersetzungssystemen. Projektarbeit, Universität Kaiserslautern, 1997. In German.
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.
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.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hillenbrand, T., Jaeger, A., Löchner, B. (1999). System Description: Waldmeister — Improvements in Performance and Ease of Use. In: Automated Deduction — CADE-16. CADE 1999. Lecture Notes in Computer Science(), vol 1632. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48660-7_20
Download citation
DOI: https://doi.org/10.1007/3-540-48660-7_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66222-8
Online ISBN: 978-3-540-48660-2
eBook Packages: Springer Book Archive