Skip to main content
Conference Proceedings

Spass version 2.0

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2002) 2392 275-279
DOI: 10.1007/3-540-45620-1_22
99Citations
Citations of this article
18Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Weidenbach, C., Brahm, U., Hillenbrand, T., Keen, E., Theobald, C., & Topić, D. (2002). Spass version 2.0. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2392, pp. 275–279). Springer Verlag. https://doi.org/10.1007/3-540-45620-1_22

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free