System Abstract: E 0.3

Authors:
Stephan Schulz
Affiliations:
-
Venue:
CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
Year:
1999

Citing 5
Cited 5

Term Indexing

Term Indexing
DISCOUNT - A Distributed and Learning Equational Prover

Journal of Automated Reasoning
Otter - The CADE-13 Competition Incarnations

Journal of Automated Reasoning
SETHEO and E-SETHEO - The CADE-13 Systems

Journal of Automated Reasoning
SPASS & FLOTTER Version 0.42

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

Synthesizing Certified Code

FME '02 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods - Getting IT Right
Learning Search Control Knowledge for Equational Theorem Proving

KI '01 Proceedings of the Joint German/Austrian Conference on AI: Advances in Artificial Intelligence
Algorithms, Datastructures, and other Issues in Efficient Automated Deduction

IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
System Abstract: E 0.61

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe the main characteristics of version 0.3 of the E equational theorem prover. E is based on superposition and rewriting. It features a powerful interface for specifying search guiding heuristics. We discuss some important details of the implementation and demonstrate the performance of the prover by presenting experimental results on the TPTP. Finally, we describe our future plans for improving the system.