Rippling: A heuristic for guiding inductive proofs

Alan Bundy, Andrew Stevens, Frank van Harmelen, Andrew Ireland, Alan Smaill
1993 Artificial Intelligence  
Bundy, A., A. Stevens, F. van Harmelen, A. Ireland and A. Smaill, Rippling: a heuristic for guiding inductive proofs, Artificial Intelligence 62 (1993) 185-253. 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
more » ... tive 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.
doi:10.1016/0004-3702(93)90079-q fatcat:aw3xcqu3zjezjlzae4o45kbwtq