TY - JOUR
T1 - Rippling: A Heuristic for Guiding Inductive Proofs
AU - Bundy, Alan
AU - Stevens, A.
AU - van Harmelen, F.
AU - Ireland, A.
AU - Smaill, A.
PY - 1993/8
Y1 - 1993/8
N2 - 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.
AB - 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.
U2 - 10.1016/0004-3702(93)90079-Q
DO - 10.1016/0004-3702(93)90079-Q
M3 - Article
SN - 0004-3702
VL - 62
SP - 185
EP - 253
JO - Artificial Intelligence
JF - Artificial Intelligence
IS - 2
ER -