Abstract
SPASS is an automated theorem prover for full first-order logic with equality and a number of non-classical logics. This system description provides an overview of our recent developments in SPASS 3.0, including support for dynamic modal logics, relational logics and expressive description logics, additional renaming and selection strategies, and significant interface enhancements for human and machine users. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Weidenbach, C., Schmidt, R. A., Hillenbrand, T., Rusev, R., & Topic, D. (2007). System description: SPASS version 3.0. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4603 LNAI, pp. 514–520). Springer Verlag. https://doi.org/10.1007/978-3-540-73595-3_38
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
