Skip to main content

System Description: Spass Version 3.0

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4603))

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.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baumgartner, P., Schmidt, R.A.: Blocking and other enhancements for bottom-up model generation methods. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol. 4130, pp. 125–139. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  2. Hustadt, U., Schmidt, R.A.: MSPASS: Modal reasoning by translation and first-order resolution. In: Dyckhoff, R. (ed.) TABLEAUX 2000. LNCS, vol. 1847, pp. 67–71. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  3. Hustadt, U., Schmidt, R.A., Georgieva, L.: A survey of decidable first-order fragments and description logics. J. Relational Meth. in Computer Sci. 1, 251–276 (2004)

    Google Scholar 

  4. Hustadt, U., Schmidt, R.A., Weidenbach, C., MSPASS,: Subsumption testing with SPASS. In: Proc. DL 1999, pp. 136–137. Linköping University (1999)

    Google Scholar 

  5. Nonnengart, A., Weidenbach, C.: Computing small clause normal forms. In: Handbook of Automated Reasoning, pp. 335–367. Elsevier, Amsterdam (2001)

    Chapter  Google Scholar 

  6. Schmidt, R.A., Hustadt, U.: First-order resolution methods for modal logics. In: Volume in memoriam of Harald Ganzinger, Springer. LNCS, Springer, Heidelberg (2006), http://www.cs.man.ac.uk/~schmidt/publications/SchmidtHustadt06a.html

    Google Scholar 

  7. Weidenbach, C., Brahm, U., Hillenbrand, T., Keen, E., Theobald, C., Topic, D.: SPASS version 2.0. In: Voronkov, A. (ed.) Automated Deduction - CADE-18. LNCS (LNAI), vol. 2392, pp. 275–279. Springer, Heidelberg (2002)

    Google Scholar 

  8. Weidenbach, C., Schmidt, R.A., Keen, E.: SPASS handbook version 3.0. Contained in the distribution of SPASS Version 3.0 (2007)

    Google Scholar 

  9. Weidenbach, C., Schmidt, R.A., Topic, D.: SPASS input syntax version 3.0. Contained in the distribution of SPASS Version 3.0 (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Frank Pfenning

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Weidenbach, C., Schmidt, R.A., Hillenbrand, T., Rusev, R., Topic, D. (2007). System Description: Spass Version 3.0. In: Pfenning, F. (eds) Automated Deduction – CADE-21. CADE 2007. Lecture Notes in Computer Science(), vol 4603. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73595-3_38

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-73595-3_38

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-73594-6

  • Online ISBN: 978-3-540-73595-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics