Skip to main content
SpringerLink
Log in

System Description: E 0.81

  • Conference paper
Automated Reasoning (IJCAR 2004)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3097))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bachmair, L., Ganzinger, H.: Rewrite-Based Equational Theorem Proving with Selection and Simplification. Journal of Logic and Computation 3(4), 217–247 (1994)

    Article  MathSciNet  Google Scholar 

  2. 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

    Google Scholar 

  3. 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)

    Google Scholar 

  4. 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)

    Chapter  Google Scholar 

  5. Schulz, S.: E – A Brainiac Theorem Prover. Journal of AI Communications 15(2/3), 111–126 (2002)

    MATH  Google Scholar 

  6. Schulz, S.: Simple and Efficient Clause Subsumption with Feature Vector Indexing (2004) (to be published)

    Google Scholar 

  7. Schulz, S.: The E Equational Theorem Prover – User Manual. See [Sch04c]

    Google Scholar 

  8. Schulz, S.: The E Web Site (2004), http://www.eprover.org

Download references

Author information

Authors and Affiliations

  1. RISC Linz, Johannes Kepler Universität Linz, Austria

    Stephan Schulz

Authors
  1. Stephan Schulz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Information Security Group, Dep. of Computer Science, ETH, Zurich, Switzerland

    David Basin

  2. LORIA & INRIA Lorraine UMR 7503,  

    Michaël Rusinowitch

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation