| Paketname | eprover-doc-html |
| Beschreibung | Theorem prover for first-order logic with equality - HTML doc |
| Archiv/Repository | Offizielles Ubuntu Archiv lucid (universe) |
| Version | 1.0.004-1ubuntu1 |
| Sektion | universe/science |
| Priorität | extra |
| Installierte Größe | 396 Byte |
| Hängt ab von | eprover |
| Empfohlene Pakete | |
| Paketbetreuer | Ubuntu MOTU Developers |
| Quelle | eprover |
| Paketgröße | 61198 Byte |
| Prüfsumme MD5 | 0a24bd99d768810ffea30a0893d9f60c |
| Prüfsumme SHA1 | 58174ed608dcfc801aa06c42a89b457c4ad1649f |
| Prüfsumme SHA256 | 40fa718fa494b96686a5c1819d260587abe15644cfb24373960eac8d609b6301 |
| Link zum Herunterladen | eprover-doc-html_1.0.004-1ubuntu1_all.deb |
| Ausführliche Beschreibung | E is a fully automatic theorem prover for full first-order logic with
equality. It accepts a mathematical specification and, optionally, a
hypothesis, and tries to prove the hypothesis and/or find a
saturation representing a (counter-)model for the specification.
.
E is based on a purely equational problem representation and
implements a variant of the superposition calculus. Proof search can
be guided with a multitude of options or a powerful automatic
configuration mode. The system can process input in a number of
different formats, including the standard TPTP-2 and TPTP-3
formats. It can generate proof objects in PCL2 or TPTP-3/TSTP
format.
.
E is considered one of the most powerful and friendly automated
theorem provers for first-order logic. It has consistently been among
the top system in the major categories of the CASC system competition,
and usually been the strongest free software system.
.
This package contains E's documentation in HTML format.
|