DISCOUNT - A Distributed and Learning Equational Prover
Journal of Automated Reasoning
The CADE-17 ATP System Competition
Journal of Automated Reasoning
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
The IJCAR ATP System Competition
Journal of Automated Reasoning
Adaptive Saturation-Based Reasoning
PSI '02 Revised Papers from the 4th International Andrei Ershov Memorial Conference on Perspectives of System Informatics: Akademgorodok, Novosibirsk, Russia
Learning Search Control Knowledge for Equational Theorem Proving
KI '01 Proceedings of the Joint German/Austrian Conference on AI: Advances in Artificial Intelligence
Combining Generic and Domain Specific Reasoning by Using Contexts
AISC '02/Calculemus '02 Proceedings of the Joint International Conferences on Artificial Intelligence, Automated Reasoning, and Symbolic Computation
DCTP - A Disconnection Calculus Theorem Prover - System Abstract
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
A rewriting approach to satisfiability procedures
Information and Computation - RTA 2001
Limited resource strategy in resolution theorem proving
Journal of Symbolic Computation - Special issue: First order theorem proving
The design and implementation of VAMPIRE
AI Communications - CASC
Automated reasoning: past story and new trends
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Combinations of theories for decidable fragments of first-order logic
FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
Unit propagation in a tableau framework
TABLEAUX'05 Proceedings of the 14th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
Hi-index | 0.00 |
We describe the main characteristics of version 0.61 of the E equational theorem prover. E is based on superposition (with literal selection) and rewriting. A particular strength of E is the ability to control the proof search very well. This is reflected by a very powerful and flexible interface for the specification of clause selection functions, and by a wide variety of functions for the selection of inference literals. We discuss some important aspects of the implementation and demonstrate the performance of the prover by presenting experimental results on the TPTP. Finally, we describe our future plans for the system.