Skip to main content
Journal Article

Planning and Patching Proof

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2004) 3249 26-37
DOI: 10.1007/978-3-540-30210-0_4
4Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Bundy, A. (2004). Planning and Patching Proof. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3249, 26–37. https://doi.org/10.1007/978-3-540-30210-0_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free