Information Services banner Edinburgh Research Archive The University of Edinburgh crest

Edinburgh Research Archive >
Informatics, School of >
Informatics Publications >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1842/4748

This item has been viewed 34 times in the last year. View Statistics

Files in This Item:

File Description SizeFormat
BundyA_Rippling A Heuristic.pdf3.19 MBAdobe PDFView/Open
Title: Rippling: A Heuristic for Guiding Inductive Proofs
Authors: Bundy, Alan
Stevens, A.
van Harmelen, F.
Ireland, A.
Smaill, A.
Issue Date: Aug-1993
Journal Title: Artificial Intelligence Journal
Volume: 62
Issue: 2
Page Numbers: 185–253
Publisher: Elsevier
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.
URI: http://hdl.handle.net/1842/4748
ISSN: 0004-3702
Appears in Collections:Informatics Publications

Items in ERA are protected by copyright, with all rights reserved, unless otherwise indicated.

 

Valid XHTML 1.0! Unless explicitly stated otherwise, all material is copyright © The University of Edinburgh 2013, and/or the original authors. Privacy and Cookies Policy