Skip to main content

Spass Version 2.0

  • Conference paper
  • First Online:
Automated Deduction—CADE-18 (CADE 2002)

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

Included in the following conference series:

Abstract

Spass is an automated theorem prover for full first-order logic with equality. This system description provides an overview of recent developments in Spass 2.0, including among others an implementation of contextual rewriting, refinements of the clause normal form transformation, and enhancements of the inference engine.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  • Afshordel, B., Hillenbrand, T. & Weidenbach, C. (2001), First-order atom definitions extended, in R. Nieuwenhuis & A. Voronkov, eds, ‘Logic for Programming, Artificial Intelligence, and Reasoning, LPAR 2001’, Vol. 2250 of LNAI, Springer, pp. 309–319.

    Google Scholar 

  • Antoniou, G. & Ohlbach, H. J. (1983), Terminator, in A. Bundy, ed., ‘Proceedings of 8th International Joint Conference on Artificial Intelligence, IJCAI-83’, pp. 916–919.

    Google Scholar 

  • Bachmair, L. & Ganzinger, H. (1994), ‘Rewrite-based equational theorem proving with selection and simplification’, Journal of Logic and Computation.

    Google Scholar 

  • Balbiani, P. (1995), Equation solving in geometrical theories, in N. Dershowitz & N. Lindenstrauss, eds, ‘Proceedings of the 4th international workshop on conditional and typed rewriting systems’, Vol. 968 of LNCS, Springer.

    Google Scholar 

  • Brinker, C. (2000), Geometrisches Schliessen mit Spass, Diplomarbeit, Universität des Saarlandes and Max-Planck-Institut für Informatik, Saarbrücken, Germany.

    Google Scholar 

  • Downey, P. J., Sethi, R. & Tarjan, R. E. (1980), ‘Variations on the common subexpression problem’, Journal of the ACM 27(4), 758–771.

    Article  MATH  MathSciNet  Google Scholar 

  • Ganzinger, H., Meyer, C. & Weidenbach, C. (1997), Soft typing for ordered resolution, in ‘Proceedings of the 14th International Conference on Automated Deduction, CADE-14’, Vol. 1249 of LNAI, Springer, Townsville, Australia, pp. 321–335.

    Google Scholar 

  • Hillenbrand, T., Jaeger, A. & Löchner, B. (1999), Waldmeister-improvements in performance and ease of use, in H. Ganzinger, ed., ‘16th International Conference on Automated Deduction, CADE-16’, LNAI, Springer, pp. 232–236.

    Google Scholar 

  • Nonnengart, A. & Weidenbach, C. (2001), Computing small clause normal forms, in A. Robinson & A. Voronkov, eds, ‘Handbook of Automated Reasoning’, Vol. 1, Elsevier, chapter 6, pp. 335–367.

    Google Scholar 

  • Topić, D. (2002), Static analysis of list-processing C programs, Diplomarbeit, Universität des Saarlandes and Max-Planck-Institut für Informatik, Saarbrücken, Germany.

    Google Scholar 

  • Weidenbach, C. (2001), Combining superposition, sorts and splitting, in A. Robinson & A. Voronkov, eds, ‘Handbook of Automated Reasoning’, Vol. 2, Elsevier, chapter 27, pp. 1965–2012.

    Google Scholar 

  • Weidenbach, C., Afshordel, B., Brahm, U., Cohrs, C., Engel, T., Keen, E., Theobalt, C. & Topic, D. (1999), System description: Spass version 1.0.0, in H. Ganzinger, ed., ‘16th International Conference on Automated Deduction, CADE-16’, Vol. 1632 of LNAI, Springer, pp. 314–318.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Weidenbach, C., Brahm, U., Hillenbrand, T., Keen, E., Theobald, C., Topić, D. (2002). Spass Version 2.0. In: Voronkov, A. (eds) Automated Deduction—CADE-18. CADE 2002. Lecture Notes in Computer Science(), vol 2392. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45620-1_22

Download citation

  • DOI: https://doi.org/10.1007/3-540-45620-1_22

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43931-8

  • Online ISBN: 978-3-540-45620-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics