Skip to main content

System Description: Tramp: Transformation of Machine-Found Proofs into Natural Deduction Proofs at the Assertion Level

  • Conference paper
Automated Deduction - CADE-17 (CADE 2000)

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

Included in the following conference series:

Abstract

The Tramp system transforms the output of several automated theorem provers for first order logic with equality into natural deduction proofs at the assertion level. Through this interface, other systems such as proof presentation systems or interactive deduction systems can access proofs originally produced by any system interfaced by Tramp only by adapting the assertion level proofs to their own needs.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. POST (1999), See at http://www.ags.uni-sb.de/~omega/primer/post.html

  2. Andrews, P.B.: Transforming matings into natural deduction proofs. In: Proc. of CADE-5, pp. 281–292 (1980)

    Google Scholar 

  3. Benzmüller, C., et al.: Ωmega: Towards a mathematical assistant. In: Proc. of CADE-14, pp. 252–255 (1997)

    Google Scholar 

  4. Benzmüller, C., Kohlhase, M.: LEO, a higher order theorem prover. In: Proc. of CADE-15, pp. 139–144 (1998)

    Google Scholar 

  5. Eisinger, N.: Completeness, confluence, and related properties of clause graph resolution. PhD thesis, Universität Kaiserslautern, Germany (1988)

    Google Scholar 

  6. Franke, A., Kohlhase, M.: MATHWEB, an agent-based communication layer for distributed automated theorem proving. In: Proc. CADE-16, pp. 217–221 (1999)

    Google Scholar 

  7. Horacek, H.: Presenting proofs in a human-oriented way. In: Proc. of CADE-16, pp. 142–156 (1999)

    Google Scholar 

  8. Huang, X.: Reconstructing proofs at the assertion level. In: Proc. of CADE-12, pp. 738–752 (1994)

    Google Scholar 

  9. Huang, X.: Translating machine-generated resolution proofs into ND-proofs at the assertion level. In: Foo, N.Y., Göbel, R. (eds.) PRICAI 1996. LNCS, vol. 1114, pp. 399–410. Springer, Heidelberg (1996)

    Google Scholar 

  10. Huang, X., Fiedler, A.: Presenting machine-found proofs. In: Proc. of CADE-13, pp. 221–225 (1996)

    Google Scholar 

  11. Meier, A.: Transformation of machine-found proofs into assertion level proofs. Technical report (2000), Available at http://www.ags.uni-sb.de/~ameier/tramp.html

  12. Pfenning, F.: Proof transformation in higher-order logic. PhD thesis, CMU, Pittsburgh, Pennsylvania, USA (1987)

    Google Scholar 

  13. Sutcliffe, G., et al.: The TPTP problem library. In: Proc. of CADE-12, pp. 252–266 (1994)

    Google Scholar 

  14. Sutcliffe, G., Suttner, C.: The results of the CADE-13 ATP system competition. Journal of Automated Reasoning 18(2), 259–264 (1997)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Meier, A. (2000). System Description: Tramp: Transformation of Machine-Found Proofs into Natural Deduction Proofs at the Assertion Level. In: McAllester, D. (eds) Automated Deduction - CADE-17. CADE 2000. Lecture Notes in Computer Science(), vol 1831. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10721959_37

Download citation

  • DOI: https://doi.org/10.1007/10721959_37

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67664-5

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics