System description: SPASS version 3.0

Christoph Weidenbach, Renate A. Schmidt, Thomas Hillenbrand, Rostislav Rusev, Dalibor Topic

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    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 languageEnglish
    Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|Lect. Notes Comput. Sci.
    Pages514-520
    Number of pages6
    Volume4603
    Publication statusPublished - 2007
    Event21st International Conference on Automated Deduction, CADE-21 2007 - Bremen
    Duration: 1 Jul 2007 → …

    Conference

    Conference21st International Conference on Automated Deduction, CADE-21 2007
    CityBremen
    Period1/07/07 → …

    Fingerprint

    Dive into the research topics of 'System description: SPASS version 3.0'. Together they form a unique fingerprint.

    Cite this