パッケージ: spass (3.9-1.1 など)
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.
その他の spass 関連パッケージ
|
|
|
|
spass のダウンロード
アーキテクチャ | バージョン | パッケージサイズ | インストールサイズ | ファイル |
---|---|---|---|---|
amd64 | 3.9-1.1 | 286.2 kB | 758.0 kB | [ファイル一覧] |
arm64 | 3.9-1.1 | 245.6 kB | 734.0 kB | [ファイル一覧] |
armel | 3.9-1.1 | 209.1 kB | 601.0 kB | [ファイル一覧] |
armhf | 3.9-1.1 | 218.7 kB | 425.0 kB | [ファイル一覧] |
i386 | 3.9-1.1 | 321.2 kB | 981.0 kB | [ファイル一覧] |
mips64el | 3.9-1.1 | 251.3 kB | 1,042.0 kB | [ファイル一覧] |
ppc64el | 3.9-1.1 | 301.8 kB | 1,106.0 kB | [ファイル一覧] |
riscv64 | 3.9-1.1+b1 | 275.6 kB | 583.0 kB | [ファイル一覧] |
s390x | 3.9-1.1 | 256.8 kB | 834.0 kB | [ファイル一覧] |