Planning and Patching Proof

  • Alan Bundy
Conference paper

DOI: 10.1007/978-3-540-30210-0_4

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3249)
Cite this paper as:
Bundy A. (2004) Planning and Patching Proof. In: Buchberger B., Campbell J. (eds) Artificial Intelligence and Symbolic Computation. AISC 2004. Lecture Notes in Computer Science, vol 3249. Springer, Berlin, Heidelberg

Abstract

We describe proof planning: a technique for both describing the hierarchical structure of proofs and then using this structure to guide proof attempts. When such a proof attempt fails, these failures can be analyzed and a patch formulated and applied. We also describe rippling: a powerful proof method used in proof planning. We pose and answer a number of common questions about proof planning and rippling.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Alan Bundy
    • 1
  1. 1.School of InformaticsUniversity of EdinburghEdinburghUK

Personalised recommendations