ISSN:
1573-0735
Keywords:
Mathematical induction
;
inductive theorem proving
;
term rewriting
Source:
Springer Online Journal Archives 1860-2000
Topics:
Economics
Notes:
Abstract Rippling is a type of rewriting developed for inductive theorem proving that uses annotations to direct search. Rippling has many desirable properties: for example, it is highly goal directed, usually involves little search, and always terminates. In this paper we give a new and more general formalization of rippling. We introduce a simple calculus for rewriting annotated terms, close in spirit to first-order rewriting, and prove that is has the formal properties desired of rippling. Next we develop criteria for proving the termination of such annotated rewriting, and introduce orders on annotated terms that lead to termination. In addition, we show how to make rippling more flexible by adapting the termination orders to the problem domain. Our work has practical as well as theoretical advantages: it has led to a very simple implementation of rippling that has been integrated in the Edinburgh CLAM system.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF00244462
Permalink
