Edinburgh Research Archive >
Informatics, School of >
Informatics Publications >
Please use this identifier to cite or link to this item:
|Title: ||Rippling: A Heuristic for Guiding Inductive Proofs|
|Authors: ||Bundy, Alan|
van Harmelen, F.
|Issue Date: ||Aug-1993|
|Journal Title: ||Artificial Intelligence Journal|
|Page Numbers: ||185–253|
|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.|
|Appears in Collections:||Informatics Publications|
Items in ERA are protected by copyright, with all rights reserved, unless otherwise indicated.