Show simple item record

Artificial Intelligence Journal

dc.contributor.authorBundy, Alanen
dc.contributor.authorStevens, A.en
dc.contributor.authorvan Harmelen, F.en
dc.contributor.authorIreland, A.en
dc.contributor.authorSmaill, A.en
dc.date.accessioned2011-02-01T14:01:13Z
dc.date.available2011-02-01T14:01:13Z
dc.date.issued1993-08
dc.identifier.issn0004-3702
dc.identifier.urihttp://hdl.handle.net/1842/4748
dc.description.abstractWe 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.en
dc.language.isoen
dc.publisherElsevieren
dc.titleRippling: A Heuristic for Guiding Inductive Proofsen
dc.typeArticleen
dc.identifier.doi10.1016/0004-3702(93)90079-Q
rps.issue2en
rps.volume62en
rps.titleArtificial Intelligence Journalen
dc.extent.pageNumbers185–253en
dc.date.updated2011-02-01T14:01:13Z


Files in this item

This item appears in the following Collection(s)

Show simple item record