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.
Original language | English |
---|---|
Title of host publication | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|Lect. Notes Comput. Sci. |
Pages | 514-520 |
Number of pages | 6 |
Volume | 4603 |
Publication status | Published - 2007 |
Event | 21st International Conference on Automated Deduction, CADE-21 2007 - Bremen Duration: 1 Jul 2007 → … |
Conference
Conference | 21st International Conference on Automated Deduction, CADE-21 2007 |
---|---|
City | Bremen |
Period | 1/07/07 → … |