Skip to main content
SpringerLink
Log in

SPASS & FLOTTER version 0.42

  • Session 2B
  • Conference paper
  • First Online:
Automated Deduction — Cade-13 (CADE 1996)

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

Included in the following conference series:

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Leo Bachmair and Harald Ganzinger. Rewrite-based equational theorem proving with selection and simplification. Journal of Logic and Computation, 4(3):217–247, 1994.

    Google Scholar 

  2. Thierry Boy de la Tour. An optimality result for clause form translation. Journal of Symbolic Computation, 14:283–301, 1992.

    Article  Google Scholar 

  3. Li Dafa. The Formulation of the Halting Problem is Not Suitable for Describing the Halting Problem. Association for Automated Reasoning Newsletter, 27:1–7, October 1994.

    Google Scholar 

  4. Peter Graf. Substitution tree indexing. In Rewriting Techniques and Applications, RTA-95, volume 914 of LNCS, pages 117–131. Springer, 1995.

    Google Scholar 

  5. William McCune. Otter 2.0. In 10th International Conference on Automated Deduction, CADE-10, volume 449 of LNCS, pages 663–664. Springer, 1990.

    Google Scholar 

  6. Hans-Jürgen Ohlbach and Manfred Schmidt-Schauß. The lion and the unicorn. Journal of Automated Reasoning, 1(3):327–332, 1985.

    Google Scholar 

  7. Hans-Jürgen Ohlbach and Christoph Weidenbach. A note on assumptions about skolem functions. Journal of Automated Reasoning, 15(2):267–275, 1995.

    Article  Google Scholar 

  8. Francis Jeffry Pelletier. Seventy-five problems for testing automatic theorem provers. Journal of Automated Reasoning, 2(2):191–216, 1986. Errata: Journal of Automated Reasoning, 4(2):235–236,1988.

    Google Scholar 

  9. Francis Jeffry Pelletier and Geoff Sutcliffe. An Erratum for Some Errata to Automated Theorem Proving Problems. Association for Automated Reasoning Newsletter, 31:8–14, December 1995.

    Google Scholar 

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

    Article  Google Scholar 

  11. Georg Rock. Transformations of first-order formulae for automated reasoning. Master's thesis, Max-Planck-Institut für Informatik, Germany, April 1995. Supervisors: H.J. Ohlbach, C. Weidenbach.

    Google Scholar 

  12. Manfred Schmidt-Schauß and Gerd Smolka. Attributive concept description with complements. Artificial Intelligence, 48:1–26, 1991.

    Article  Google Scholar 

  13. Mark Stickel. Schubert's steamroller problem: Formulations and solutions. Journal of Automated Reasoning, 2(1):89–101, 1986.

    Article  Google Scholar 

  14. Christoph Weidenbach. Extending the resolution method with sorts. In Proc. of 13th International Joint Conference on Artificial Intelligence, IJCAI-93, pages 60–65. Morgan Kaufmann, 1993.

    Google Scholar 

  15. Christoph Weidenbach. First-order tableaux with sorts. Journal of the Interest Group in Pure and Applied Logics, IGPL, 3(6):887–906, 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Christoph Weidenbach, Bernd Gaede & Georg Rock

Authors
  1. Christoph Weidenbach
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bernd Gaede
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Georg Rock
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

M. A. McRobbie J. K. Slaney

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Weidenbach, C., Gaede, B., Rock, G. (1996). SPASS & FLOTTER version 0.42. In: McRobbie, M.A., Slaney, J.K. (eds) Automated Deduction — Cade-13. CADE 1996. Lecture Notes in Computer Science, vol 1104. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61511-3_75

Download citation

  • DOI: https://doi.org/10.1007/3-540-61511-3_75

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation