Rippling: A Heuristic for Guiding Inductive Proofs

Alan Bundy, A. Stevens, F. van Harmelen, A. Ireland, A. Smaill

Research output: Contribution to journalArticlepeer-review


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.
Original languageEnglish
Pages (from-to)185–253
JournalArtificial Intelligence
Issue number2
Publication statusPublished - Aug 1993


Dive into the research topics of 'Rippling: A Heuristic for Guiding Inductive Proofs'. Together they form a unique fingerprint.

Cite this