Abstract
We propose using proof plans to implement expression normalizers in automatic theorem proving. We outline some general-purpose proof plans and show how these can be combined in various ways to yield some standard normalizers. We claim that using proof plans facilitates the flexible application of these normalizers so that they can interact with the theorem prover in which they are embedded. We intend to extend this technique to decision procedures.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. S. Boyer and J. S. Moore (1988): Integrating Decision Procedures into Heuristic Theorem Provers: A Case Study of Linear Arithmetic. In: J. E. Hayes, J. Richards, and D. Michie, eds.: Machine Intelligence 11, 83–124.
L. Hodes (1971): Solving Problems by Formula Manipulation. Proceedings of the Second IJCAI, The British Computer Society, 553–559.
A. Bundy (1988): The Use of Explicit Plans to Guide inductive Proofs. Proceedings of CADE-9, R. Lusk and R. Overbeek, eds. Lecture Notes in Computer Science 310, Springer-Verlag, 111–120. Longer version available from Edinburgh as Research Paper No. 349.
A. Bundy, F. van Harmelen, J. Hesketh, and A. Smaill (in press): Experiments with Proof Plans for Induction. Journal of Automated Reasoning Earlier version available from Edinburgh as Research Paper No. 413.
R.V. Desimone (1989): Learning Control Knowledge within an Explanation-Based Learning Framework. Ph. D. thesis, Dept. of Artificial Intelligence, University of Edinburgh.
L. Sterling, A. Bundy, L. Byrd, R. O’Keefe, and B. Silver (1989): Solving Symbolic Equations with PRESS. J. Symbolic Computation 7,71–84. Also available from Edinburgh as Research Paper No. 171.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Bundy, A. (1991). The Use of Proof Plans for Normalization. In: Boyer, R.S. (eds) Automated Reasoning. Automated Reasoning Series, vol 1. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-3488-0_7
Download citation
DOI: https://doi.org/10.1007/978-94-011-3488-0_7
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-5542-0
Online ISBN: 978-94-011-3488-0
eBook Packages: Springer Book Archive