Skip to main content
SpringerLink
Log in
Book cover

International Meeting of Young Computer Scientists

IMYCS 1990: Aspects and Prospects of Theoretical Computer Science pp 261–270Cite as

Representing heuristic-relevant information for an automated theorem prover

  • Part III Communications
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 464))

Abstract

A promising approach to attack the problem of combinatorial explosion faced in automated theorem proving is to employ search guiding heuristics. Our system, which is able to learn such heuristics automatically, uses evaluation functions to rate different choices for continuation during a proof. In this paper, we will focus on the content and representation of the input to these evaluation functions.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [BES+81] K. Bläsius, N. Eisinger, J. Siekmann, G. Smolka, A. Herold, and C. Walther. The Markgraf Karl Refutation Proof Procedure. In Proceedings of the Seventh International Joint Conference on Artificial Intelligence, Vancouver, 1981.

    Google Scholar 

  2. C.-L. Chang and R.C.-T. Lee. Symbolic Logic and Mechanical Theorem Proving. Academic Press, 1973.

    Google Scholar 

  3. W. Ertel, J. Schumann, and C.B. Suttner. Learning Heuristics for a Theorem Prover using Back Propagation. In Proceedings of the 5. ÖGAI-Conference, Igls, Austria, 1989. Springer.

    Google Scholar 

  4. R. Letz, S. Bayerl, J. Schumann, and W. Bibel. SETHEO: A High-Performance Theorem Prover. to appear in: Journal of Automated Reasoning.

    Google Scholar 

  5. D.W. Loveland. Mechanical Theorem-Proving by Model Elimination. Journal of the ACM, 15(2), 1968.

    Google Scholar 

  6. R. Overbeek, J. McCharen, and L. Wos. Complexity and Related Enhancements for Automated Theorem-Proving Programs. Comp. & Maths. with Appls., 2(1-A), 1976.

    Google Scholar 

  7. D.E. Rumelhart, G.E. Hinton, and R.J. Williams. Learning Internal Representations by Error Propagation. In Parallel Distributed Processing, 1986.

    Google Scholar 

  8. A.L. Samuel. Some Studies in Machine Learning Using the Game of Checkers. IBM Journal, 1(3), 1959.

    Google Scholar 

  9. A.L. Samuel. Some Studies in Machine Learning Using the Game of Checkers, II. IBM Journal, 11(6), 1967.

    Google Scholar 

  10. C.B. Suttner and W. Ertel. Automatic Acquisition of Search Guiding Heuristics. In Proceedings of the 10. International Conference on Automated Deduction (CADE). Springer, 1990.

    Google Scholar 

  11. J.R. Slagle and C.D. Farrell. Experiments in Automatic Learning for a Multipurpose Heuristic Program. Comm. of the ACM, 14(2), 1971.

    Google Scholar 

  12. M.E. Stickel. Schubert's Steamroller Problem: Formulations and Solutions. Journal of Automated Reasoning, 2:89–101, 1986.

    Google Scholar 

  13. C.B. Suttner. Learning Heuristics for Automated Theorem Proving. Diploma Thesis, Technical University Munich, May 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Forschungsgruppe Künstliche Intelligenz, Technische Universität München, Augustenstr. 46 Rgb, D-8000, München 2

    Christian B. Suttner

Authors
  1. Christian B. Suttner
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jürgen Dassow Jozef Kelemen

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Suttner, C.B. (1990). Representing heuristic-relevant information for an automated theorem prover. In: Dassow, J., Kelemen, J. (eds) Aspects and Prospects of Theoretical Computer Science. IMYCS 1990. Lecture Notes in Computer Science, vol 464. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53414-8_49

Download citation

  • DOI: https://doi.org/10.1007/3-540-53414-8_49

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53414-3

  • Online ISBN: 978-3-540-46869-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation