The University of Edinburgh -
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
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.

[Search These Pages] [DAI Home Page] [Comment]