1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
|
Source: spass
Section: science
Priority: optional
Build-Depends: debhelper (>= 4.0.0)
Maintainer: Roland Stigge <stigge@antcom.de>
Standards-Version: 3.8.0
Package: spass
Architecture: any
Depends: ${shlibs:Depends}
Description: An automated theorem prover for first-order logic with equality
SPASS is a saturation-based automated theorem prover for first-order logic with
equality. It is unique due to the combination of the superposition calculus
with specific inference/reduction rules for sorts (types) and a splitting rule
for case analysis motivated by the beta-rule of analytic tableaux and the case
analysis employed in the Davis-Putnam procedure. Furthermore, SPASS provides a
sophisticated clause normal form translation.
.
This package consists of the SPASS/FLOTTER binary, documentation, and a small
example collection. The tools collections contain the proof checker pcs, the
syntax translators dfg2otter and dfg2tptp, and the ASCII pretty printer
dfg2ascii.
.
For more information, additional and partly huge example collections, consider
the project homepage at http://spass.mpi-sb.mpg.de/.
|
