System Description: Waldmeister — Improvements in Performance and Ease of Use
- 319 Downloads
Waldmeister is an automated theorem prover for unconditional equational logic. It is based on unfailing Knuth-Bendix completion . 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.
Unable to display preview. Download preview PDF.
- 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
- 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
- A. Jaeger. Anwendungen von Nachfolgermengen in Termersetzungssystemen. Projektarbeit, Universität Kaiserslautern, 1997. In German.Google Scholar
- 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