Inproceedings,

SPASS Version 2.0

, , , , , and .
Automated deduction, CADE-18 : 18th International Conference on Automated Deduction, volume 2392 of Lecture Notes in Artificial Intelligence, page 275--279. Kopenhagen, Denmark, Springer, (2002)

Abstract

SPASS is an automated theorem prover for full first-order logic with equality. This system description provides an overview of recent developments in SPASS 2.0, including among others an implementation of contextual rewriting, refinements of the clause normal form transformation, and enhancements of the inference engine.

Tags

Users

  • @lonzo

Comments and Reviews