Bundy A. (1988) The use of explicit plans to guide inductive proofs. In: Lusk E., Overbeek R. (eds) 9th International Conference on Automated Deduction. CADE 1988. Lecture Notes in Computer Science, vol 310. Springer, Berlin, Heidelberg
We propose the use of explicit proof plans to guide the search for a proof in automatic theorem proving. By representing proof plans as the specifications of LCF-like tactics, [Gordon et al 79], and by recording these specifications in a sorted meta-logic, we are able to reason about the conjectures to be proved and the methods available to prove them. In this way we can build proof plans of wide generality, formally account for and predict their successes and failures, apply them flexibly, recover from their failures, and learn them from example proofs.
We illustrate this technique by building a proof plan based on a simple subset of the implicit proof plan embedded in the Boyer-Moore theorem prover, [Boyer & Moore 79].
Space restrictions have forced us to omit many of the details of our work. These are included in a longer version of this paper which is available from: The Documentation Secretary, Department of Artificial Intelligence, University of Edinburgh, Forrest Hill, Edinburgh EH1 2QL, Scotland.