A. Bundy, A. Stevens, F. van Harmelen, A. Ireland, and A. Smaill: Rippling: a heuristic for guiding inductive proofs. AI-Journal, 62:185--253, 1993. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Annotated Reasoning - Hutter (Correct)
....about parts of proof objects. During the proof process, as new formulas are deduced, the knowledge given initially has to be transmitted to the evolving structures. Tactics guiding the proof search take this knowledge into account to calculate next deduction steps. For example, rippling [ Bundy et al. 1993; Hutter, 1997 ] is an instance of this methodology in the area of inductive theorem proving. It uses the semantic information that we must apply the induction hypothesis to rewrite the induction conclusion. Additionally it assumes that the hypothesis is always homomorphically embedded in the ....
....proof in the underlying (non annotated) calculus. Such a specialization is a requirement to come up with an appropriate methodology how to make use of such labels. There are countless papers describing techniques which can be viewed as instances of our methodology like for instance rippling [ Bundy et al. 1993 ] or difference reduction techniques in equality reasoning [ Hutter, 1997 ] In [ Melis and Schairer, 1998 ] the colour calculus is used to implement a reuse technique different from the one we presented here. Gardent et al. 1999 ] use annotated logics to prevent over generation in natural ....
A. Bundy, A. Stevens, F. van Harmelen, A. Ireland, and A. Smaill: Rippling: a heuristic for guiding inductive proofs. AI-Journal, 62:185--253, 1993.
VSE: Formal Methods Meet Industrial Needs - Autexier, Hutter, Langenstein.. (2000) (Correct)
....with the conditionals of the rewrite rule. Proving the individual cases we distinguish two cases: In the first case where the selected rewrite rules contain non primed variables in their value part, we try to reduce Inv( X 0 ) to Inv(X) which is done with the help of rippling on annotated terms [5,11]. Rippling is based on an explicit representation of differences between terms by classifying each symbol occurrence either as a skeleton part (i.e. a white part which will not be changed during deduction) or a wave front part (i.e. a grey part which may be changed during deduction) Classifying ....
A. Bundy, A. Stevens, F. van Harmelen, A. Ireland, and A. Smaill: Rippling: A Heuristic for Guiding Inductive Proofs. AI, 62:185--253, 1993.
VSE: Formal Methods Meet Industrial Needs - Autexier, Hutter, Langenstein.. (2000) (Correct)
....with the conditionals of the rewrite rule. Proving the individual cases we distinguish two cases: In the first case where the selected rewrite rules contain non primed variables in their value part, we try to reduce Inv( X 0 ) to Inv(X) which is done with the help of rippling on annotated terms [4,9]. Rippling is based on an explicit representation of differences between terms by classifying each symbol occurrence either as a skeleton part (i.e. a white part which will not be changed during deduction) or a wave front part (i.e. a grey part which may be changed during deduction) Classifying ....
A. Bundy, A. Stevens, F. van Harmelen, A. Ireland, and A. Smaill: Rippling: A Heuristic for Guiding Inductive Proofs. AI, 62:185--253, 1993.
Deductive Verification of Invariants of State-Transition Systems - Hutter (Correct)
No context found.
A. Bundy, A. Stevens, F. v. Harmelen, A. Ireland, and A. Smaill: Rippling: a heuristic for guiding inductive proofs. Journal of Artificial Intelligence, pp. 185-253, No. 62, 1993
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC