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.
Access this article
Rent this article via DeepDyve
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
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.
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.
Nieuwenhuis, R. and Rubio, A.: Theorem proving with ordering and equality constrained clauses, Journal of Symbolic Computation 19 (1995), 321–351.
Peterson, G. E.: A technique for establishing completeness results in theorem proving with equality, SIAM Journal of Computation 12(1) (1983), 82–100.
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.
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.
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.
Author information
Authors and Affiliations
Rights 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
Issue Date:
DOI: https://doi.org/10.1023/A:1005812220011