Abstract
E is an equational theorem prover for clausal logic with equality. We describe the latest version, E 0.81 Tumsong, with special emphasis on the important aspects that have changed compared to previously described versions.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bachmair, L., Ganzinger, H.: Rewrite-Based Equational Theorem Proving with Selection and Simplification. Journal of Logic and Computation 3(4), 217–247 (1994)
Löchner, B., Schulz, S.: An Evaluation of Shared Rewriting. In: de Nivelle, H., Schulz, S. (eds.) Proc. 2nd IWIL, MPI Preprint, Saarbrücken, pp. 33–48 (2001); Max-Planck-Institut für Informatik
Riazanov, A., Voronkov, A.: Splitting without Backtracking. In: Nebel, B. (ed.) Proc. 17th IJCAI, Seattle, vol. 1, pp. 611–617. Morgan Kaufmann, San Francisco (2001)
Schulz, S.: System Abstract: E 0.61. In: Goré, R.P., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS (LNAI), vol. 2083, pp. 370–375. Springer, Heidelberg (2001)
Schulz, S.: E – A Brainiac Theorem Prover. Journal of AI Communications 15(2/3), 111–126 (2002)
Schulz, S.: Simple and Efficient Clause Subsumption with Feature Vector Indexing (2004) (to be published)
Schulz, S.: The E Equational Theorem Prover – User Manual. See [Sch04c]
Schulz, S.: The E Web Site (2004), http://www.eprover.org
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schulz, S. (2004). System Description: E 0.81. In: Basin, D., Rusinowitch, M. (eds) Automated Reasoning. IJCAR 2004. Lecture Notes in Computer Science(), vol 3097. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25984-8_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-25984-8_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22345-0
Online ISBN: 978-3-540-25984-8
eBook Packages: Springer Book Archive