Skip to main content
SpringerLink
Log in

SPASS - Version 0.49

  • Published:
Journal of Automated Reasoning Aims and scope Submit manuscript

Abstract

This article describes SPASS, Version 0.49, as it was entered in the system competition at CADE-13. SPASS is an automated theorem prover for full first-order logic with equality. It is based on the superposition calculus originally developed by Bachmair and Ganzinger, extended by the sort techniques due to Weidenbach and an inference rule for case analysis.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bachmair, L. and Ganzinger, H.: Rewrite-based equational theorem proving with selection and simplification, Journal of Logic and Computation 4(3) (1994), 217–247. Revised version of Max-Planck-Institut für Informatik Technical Report, MPI-I-91-208, 1991.

    Google Scholar 

  2. Bachmair, L., Ganzinger, H., Lynch, Ch. and Snyder, W.: Basic paramodulation, Information and Computation 121(2) (1995), 172–192. Revised version of Max-Planck-Institut füur Informatik Technical Report, MPI-I-93-236, 1993.

    Google Scholar 

  3. Nieuwenhuis, R. and Rubio, A.: Theorem proving with ordering and equality constrained clauses, Journal of Symbolic Computation 19 (1995), 321–351.

    Google Scholar 

  4. Peterson, G. E.: A technique for establishing completeness results in theorem proving with equality, SIAM Journal of Computation 12(1) (1983), 82–100.

    Google Scholar 

  5. Weidenbach, Ch.: Extending the resolution method with sorts, in Proc. of 13th International Joint Conference on Artificial Intelligence, IJCAI-93, Morgan Kaufmann, 1993, pp. 60–65.

  6. Weidenbach, Ch.: Unification in pseudo-linear sort theories is decidable, in M. A. McRobbie and J. K. Slaney (eds), 13th International Conference on Automated Deduction, CADE-13, LNAI 1104, Springer, 1996, pp. 343–357.

  7. Weidenbach, Ch., Gaede, B. and Rock, G.: SPASS and FLOTTER, version 0.42, in M. A. McRobbie and J. K. Slaney (eds), 13th International Conference on Automated Deduction, CADE-13, LNAI 1104, Springer, 1996, pp. 141–145.

Download references

Author information

Authors and Affiliations

  1. Max-Planck-Institut für Informatik, Saarbrücken, Germany

    Christoph Weidenbach

Authors
  1. Christoph Weidenbach
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Weidenbach, C. SPASS - Version 0.49. Journal of Automated Reasoning 18, 247–252 (1997). https://doi.org/10.1023/A:1005812220011

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1005812220011

Search

Navigation