Skip to main content
SpringerLink
Log in

General purpose proof plans

  • Conference paper
  • First Online:
Design and Implementation of Symbolic Computation Systems (DISCO 1993)

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

  • 206 Accesses

Abstract

One of the key problems in the design and implementation of automated reasoning systems is the specification of heuristics to control search. “Proof planning” has been developed as a powerful technique for declaratively specifying high-level proof strategies. This paper describes an extension to proof planning to allow for the specification of more general purpose plans.

This research was supported in part by a SERC Postdoctoral Fellowship. I am grateful to Renato Busatto-Neto for his feedback and for implementing several general purpose proof plans for normalisation. I would also like to thank Alan Bundy and all the other members of the Mathematical Reasoning Group.

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. A. Bundy. The use of explicit plans to guide inductive proofs. In R. Lusk and R. Overbeek, editors, 9th Conference on Automated Deduction, pages 111–120. Springer-Verlag, 1988.

    Google Scholar 

  2. A. Bundy. The use of proof plans for normalization. In R.S. Boyer, editor, Essays in Honor of Woody Bledsoe, pages 149–166. Kluwer, 1991.

    Google Scholar 

  3. A. Bundy, F. van Harmelen, C. Horn, and A. Smaill. The Oyster-Clam system. In M.E. Stickel, editor, 10th International Conference on Automated Deduction, pages 647–648. Springer-Verlag, 1990.

    Google Scholar 

  4. A. Felty. Specifying and implementing theorem provers in a Higher Order Programming Language. PhD thesis, University of Pennsylvania, 1989.

    Google Scholar 

  5. M.J. Gordon, A.J. Milner, and C.P. Wadsworth. Edinburgh LCF — A mechanised logic of computation, volume 78 of Lecture Notes in Computer Science. Springer Verlag, 1979.

    Google Scholar 

  6. P. Traverso, A. Cimatti, and L. Spalazzi. Beyond the single planning paradigm: introspective planning. In Proceedings of the 9th ECAI, 1992.

    Google Scholar 

Download references

Author information

Author notes

  1. Toby Walsh

    Present address: INRIA-Lorraine, 615 rue du Jardin Botanique, B.P. 101, F-54602, Villers-les-Nancy, France

Authors and Affiliations

  1. Department of Artificial Intelligence, University of Edinburgh, UK

    Toby Walsh

Authors
  1. Toby Walsh
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Toby Walsh .

Editor information

Alfonso Miola

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Walsh, T. (1993). General purpose proof plans. In: Miola, A. (eds) Design and Implementation of Symbolic Computation Systems. DISCO 1993. Lecture Notes in Computer Science, vol 722. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0013194

Download citation

  • DOI: https://doi.org/10.1007/BFb0013194

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57235-0

  • Online ISBN: 978-3-540-47985-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation