Categories
E
E is an equational theorem prover. You give it a mathematical specification (in clausal logic with equality) and a hypothesis; it will then try to find a proof for the hypothesis (and sometimes succeed).
E is build on top of (and by now inseparable from) CLIB, a collection of library functions for building programs the follow the basic input-processing-output paradigm, with additional support for most levels of first-order logic. The code has been used to build a couple of other applications by now.
CLIB is layered, with higher layers becoming more specialized. Lower levels take care of the scientifically uninteresting, but necessary services for production-quality efficient programs, e.g. error handling, memory management, parsing of input, etc. They should be useful for most programs. Higher level modules implement shared and unshared terms, equations, clauses and related stuff.
Last updated 16 Jan, 2004
About
Leadership
- Stephan Schulz - Maintainer
Requirements
- LaTeX2e (Weak Prerequisite)
Subprograms
CLIB
Versions
0.81
0.81 beta released on 2004-01-16
- Released: 16 Jan, 2004
- Code Maturity: Beta
- Source Archive: http://www4.informatik.tu-muenchen.de/~schulz/W...
- Licenses: GPLv2
- Interfaces: Command Line, Library
User Community and Support
User guide in LaTeX format included; User guide in PostScript format available from http://www4.informatik.tu-muenchen.de/~schulz/WORK/eprover.ps; User guide in PDF format available from http://www4.informatik.tu-muenchen.de/~schulz/WORK/eprover.pdf; User README available in HTML format from http://www4.informatik.tu-muenchen.de/~schulz/WORK/E_DOWNLOAD/V_0.81/README



