Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
E (theorem prover)
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==System== The system is based on the equational [[superposition calculus]]. In contrast to most other current provers, the implementation actually uses a purely equational paradigm, and simulates non-equational inferences via appropriate equality inferences. Significant innovations include shared term rewriting (where many possible equational simplifications are carried out in a single operation),<ref name=casc2008>{{Cite web|url=http://www.cs.miami.edu/~tptp/CASC/J4/SystemDescriptions.html#E---1.0pre|title=Entrants System Descriptions: E 1.0pre and EP 1.0pre|last=Schulz|first=Stephan|year=2008|accessdate=2009-03-24|archive-date=15 June 2009|archive-url=https://web.archive.org/web/20090615180620/http://www.cs.miami.edu/~tptp/CASC/J4/SystemDescriptions.html#E---1.0pre|url-status=dead}}</ref> several efficient [[term indexing]] data structures for speeding up inferences, advanced inference literal selection strategies, and various uses of machine learning techniques to improve the search behaviour.<ref name=casc2008/><ref>{{Cite book|last=Schulz|first=Stephan|title=Automated Reasoning |chapter=System Description: E 0.81 |year=2004 |pages=223β228|doi=10.1007/978-3-540-25984-8_15|series=Lecture Notes in Computer Science|volume=3097 |isbn=978-3-540-22345-0}}</ref><ref>{{Cite book|last=Schulz|first=Stephan|title=KI 2001: Advances in Artificial Intelligence |chapter=Learning Search Control Knowledge for Equational Theorem Proving |year=2001 |pages=320β334|doi=10.1007/3-540-45422-5_23|series=Lecture Notes in Computer Science|volume=2174 |isbn=978-3-540-42612-7}}</ref> Since version 2.0, E supports [[many-sorted logic]].<ref>{{Cite web|url=https://wwwlehre.dhbw-stuttgart.de/~sschulz/E/E.html|accessdate=2017-07-10|title=news on E's website}}</ref> E is implemented in [[C (programming language)|C]] and portable to most [[Unix|UNIX]] variants and the [[Cygwin]] environment. It is available under the [[GNU General Public License|GNU GPL]].<ref>{{Cite web|url=http://www.eprover.org|title=The E Equational Theorem Prover|last=Schulz|first=Stephan|year=2008|accessdate=2009-03-24}}</ref>
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)