WALDMEISTER - High-Performance Equational Deduction

Authors:
Thomas Hillenbrand;Arnim Buch;Roland Vogt;Bernd Löchner
Affiliations:
Fachbereich Informatik, Universität Kaiserslautern, Kaiserslautern, Germany. e-mail: {buch,hillen,loechner}@informatik.uni-kl.de;Fachbereich Informatik, Universität Kaiserslautern, Kaiserslautern, Germany. e-mail: {buch,hillen,loechner}@informatik.uni-kl.de;Fachbereich Informatik, Universität Kaiserslautern, Kaiserslautern, Germany. e-mail: {buch,hillen,loechner}@informatik.uni-kl.de;Fachbereich Informatik, Universität Kaiserslautern, Kaiserslautern, Germany. e-mail: {buch,hillen,loechner}@informatik.uni-kl.de
Venue:
Journal of Automated Reasoning
Year:
1997

Citing 5
Cited 22

Experiments with discrimination-tree indexing and path indexing for term retrieval

Journal of Automated Reasoning
Term Indexing

Term Indexing
Fast Knuth-Bendix Completion: Summary

RTA '89 Proceedings of the 3rd International Conference on Rewriting Techniques and Applications
DISCOUNT: A SYstem for Distributed Equational Deduction

RTA '95 Proceedings of the 6th International Conference on Rewriting Techniques and Applications
Benchmark Problems in Which Equality Plays the Major Role

CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction

The CADE-14 ATP System Competition

Journal of Automated Reasoning
DISCOUNT - A Distributed and Learning Equational Prover

Journal of Automated Reasoning
The CADE-15 ATP System Competition

Journal of Automated Reasoning
Short Single Axioms for Boolean Algebra

Journal of Automated Reasoning
Knuth-Bendix Constraint Solving Is NP-Complete

ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Adaptive Saturation-Based Reasoning

PSI '02 Revised Papers from the 4th International Andrei Ershov Memorial Conference on Perspectives of System Informatics: Akademgorodok, Novosibirsk, Russia
Algorithms, Datastructures, and other Issues in Efficient Automated Deduction

IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
System Description: Waldmeister - Improvements in Performance and Ease of Use

CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
On the Evaluation of Indexing Techniques for Theorem Proving

IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Context Trees

IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Vampire 1.1 (System Description)

IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Presenting Mathematical Concepts as an Example for Inference-Rich Domains

NLDB '00 Proceedings of the 5th International Conference on Applications of Natural Language to Information Systems-Revised Papers
Term indexing

Handbook of automated reasoning
Limited resource strategy in resolution theorem proving

Journal of Symbolic Computation - Special issue: First order theorem proving
On using ground joinable equations in equational theorem proving

Journal of Symbolic Computation - Special issue: First order theorem proving
Fast Term Indexing with Coded Context Trees

Journal of Automated Reasoning
Equational prover of theorema

RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Comparing unification algorithms in first-order theorem proving

KI'09 Proceedings of the 32nd annual German conference on Advances in artificial intelligence
Integrating an automated theorem prover into agda

NFM'11 Proceedings of the Third international conference on NASA Formal methods
Semantic guidance for saturation provers

AISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Symbolic Computation
Perfect discrimination graphs: indexing terms with integer exponents

IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
Dependently typed programming based on automated theorem proving

MPC'12 Proceedings of the 11th international conference on Mathematics of Program Construction

Quantified Score

Hi-index	0.00

Visualization

Abstract

Waldmeister is a high-performance theorem prover for unit equational first-order logic. In the making of Waldmeister, we have applied an engineering approach, identifying the critical points with respect to efficiency in time and space. Our logical three-level system model consists of the basic operations on the lowest level, where we put great stress on efficient data structures and algorithms. For the middle level, where the inference steps are aggregated into an inference machine, flexible adjustment has proven essential during experimental evaluation. The top level holds control strategy and reduction ordering. Although at this level only standard strategies are employed, really large proof tasks have been managed in reasonable time.