SPASS Version 3.5

  • Christoph Weidenbach
  • Dilyana Dimova
  • Arnaud Fietzke
  • Rohit Kumar
  • Martin Suda
  • Patrick Wischnewski
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5663)

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.5 including subterm contextual rewriting, improved split backtracking, a significantly faster FLOTTER implementation with additional control flags, completely symmetric implementation of forward and backward redundancy criteria, faster parsing with improved support for big files, faster and extended sort module, and support for include commands in input files. Finally, SPASS 3.5 can now parse files in TPTP syntax, comes with a new converter tptp2dfg and is distributed under a BSD style license.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bachmair, L., Ganzinger, H.: Rewrite-based equational theorem proving with selection and simplification. Journal of Logic and Computation 4(3), 217–247 (1994); Revised version of Max-Planck-Institut für Informatik technical report, MPI-I-91-208 (1991)MathSciNetCrossRefMATHGoogle Scholar
  2. Fietzke, A., Weidenbach, C.: Labelled splitting. In: Armando, A., Baumgartner, P., Dowek, G. (eds.) IJCAR 2008. LNCS, vol. 5195, pp. 459–474. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  3. Ganzinger, H., Meyer, C., Weidenbach, C.: Soft typing for ordered resolution. In: McCune, W. (ed.) CADE 1997. LNCS (LNAI), vol. 1249, pp. 321–335. Springer, Heidelberg (1997)CrossRefGoogle Scholar
  4. Ganzinger, H., Nieuwenhuis, R.: The saturate system 1994 (1994), http://www.mpi-sb.mpg.de/SATURATE/Saturate.html
  5. Ganzinger, H., Stuber, J.: Inductive theorem proving by consistency for first-order clauses. In: Rusinowitch, M., Remy, J.-L. (eds.) CTRS 1992. LNCS, vol. 656, pp. 226–241. Springer, Heidelberg (1992)CrossRefGoogle Scholar
  6. Hillenbrand, T., Weidenbach, C.: Superposition for finite domains. Research Report MPI-I-2007-RG1-002, Max-Planck Institute for Informatics, Saarbruecken, Germany (April 2007)Google Scholar
  7. Horbach, M., Weidenbach, C.: Decidability results for saturation-based model building. In: Schmidt, R.A. (ed.) CADE 2009. LNCS (LNAI), vol. 5663, pp. 404–420. Springer, Heidelberg (2009)Google Scholar
  8. Nonnengart, A., Weidenbach, C.: Computing small clause normal forms. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, ch. 6, vol. 1, pp. 335–367. Elsevier, Amsterdam (2001)CrossRefGoogle Scholar
  9. Sutcliffe, G., Suttner, C.B.: The TPTP problem library – cnf release v1.2.1. Journal of Automated Reasoning 21(2), 177–203 (1998)MathSciNetCrossRefMATHGoogle Scholar
  10. Weidenbach, C.: Unification in sort theories and its applications. Annals of Mathematics and Artificial Intelligence 18(2-4), 261–293 (1996)MathSciNetCrossRefMATHGoogle Scholar
  11. Weidenbach, C.: Combining superposition, sorts and splitting. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, ch. 27, vol. 2, pp. 1965–2012. Elsevier, Amsterdam (2001)CrossRefGoogle Scholar
  12. Weidenbach, C., Schmidt, R., Hillenbrand, T., Rusev, R., Topic, D.: Spass version 3.0. In: Pfenning, F. (ed.) CADE 2007. LNCS, vol. 4603, pp. 514–520. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  13. Weidenbach, C., Wischnewski, P.: Contextual rewriting in Spass. In: PAAR/ESHOL, Sydney, Australien. CEUR Workshop Proceedings, vol. 373, pp. 115–124 (2008)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Christoph Weidenbach
    • 1
  • Dilyana Dimova
    • 1
  • Arnaud Fietzke
    • 1
  • Rohit Kumar
    • 1
  • Martin Suda
    • 1
  • Patrick Wischnewski
    • 1
  1. 1.Max-Planck-Institut für Informatik, Email: spass@mpi-inf.mpg.deSaarbrücken

Personalised recommendations