books.google.com-Rippling is a radically new technique for the automation of mathematical reasoning. It is widely applicable whenever a goal The AI4FM approach for proof automation within formal methods Rippling: Meta-Level Guidance for Mathematical Reasoning Cambridge Tracts in Theoretical Computer Science Alan Bundy, David Basin, Dieter Hutter,. Dynamic Rippling, Middle-Out Reasoning and Lemma Discovery Rippling refers to a group of meta-level heuristics, developed primarily in the. Rippling may be viewed as a restricted form of rewrite system, where special object Jump up ^ Rippling: Meta-Level Guidance for Mathematical Reasoning, Alan Automated search for Gödel's proofs-ScienceDirect Review of rippling: meta-level guidance for mathematical reasoning cambridge tracks in theoretical

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.

No abstract

No abstract

No abstract