System Description: Spass Version 3.0

  • Authors:
  • Christoph Weidenbach;Renate A. Schmidt;Thomas Hillenbrand;Rostislav Rusev;Dalibor Topic

  • Affiliations:
  • Max-Planck-Institut für Informatik, Email:spass@mpi-sb.mpg.de, Germany;University of Manchester, UK;Max-Planck-Institut für Informatik, Email:spass@mpi-sb.mpg.de, Germany;Max-Planck-Institut für Informatik, Email:spass@mpi-sb.mpg.de, Germany;Max-Planck-Institut für Informatik, Email:spass@mpi-sb.mpg.de, Germany

  • Venue:
  • CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Spassis 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 Spass3.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.