Division of Informatics
Forrest Hill & 80 South Bridge
Research Paper #567 | |
|---|---|
| Title: | Rippling: a Heuristic for Guiding Inductive Proofs |
| Authors: | Bundy,A; Stevens,A; van Harmelen,F |
| Date: | Dec 1991 |
| Presented: | Submitted to the Artificial Intelligence Journal |
| Keywords: | |
| Abstract: | We describe rippling: a tactic for the heuristic control of the key part of proofs by mathematical induction. This tactic significantly reduces the search for a proof of a wide variety of inductive theorems. We first present a basic version of rippling, followed by various extensions which are necessary to capture larger classes of inductive proofs. Finally, we present a generalised form of rippling which embodies these extensions as special cases. We prove that generalised rippling always terminates, and we discuss the implementation of the tactic and its relation with other inductive proof search heuristics. |
| Download: | POSTSCRIPT COPY |
![[Search These Pages]](http://www.dai.ed.ac.uk/icons/dai_search.gif){kind=icon}
![[DAI Home Page]](http://www.dai.ed.ac.uk/icons/dai_home.gif){kind=icon}
![[Comment]](http://www.dai.ed.ac.uk/icons/dai_comment.gif){kind=icon}