A Calculus for and Termination of Rippling

Basin, David A.; Walsh, Toby

doi:10.1007/BF00244462

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

タグ情報を表示リリース履歴を表示詳細要約

公開

学術論文

A Calculus for and Termination of Rippling

MPS-Authors

/persons/resource/persons44075

Basin, David A.
Programming Logics, MPI for Informatics, Max Planck Society;

/persons/resource/persons45692

Walsh, Toby
Programming Logics, MPI for Informatics, Max Planck Society;

External Resource

https://rdcu.be/dtXAS
(出版社版)

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

フルテキスト (公開)

公開されているフルテキストはありません

付随資料 (公開)

There is no public supplementary material available

引用

Basin, D. A., & Walsh, T. (1996). A Calculus for and Termination of Rippling. Journal of Automated Reasoning, 16(1/2), 147-180. doi:10.1007/BF00244462.

引用: https://hdl.handle.net/11858/00-001M-0000-0014-ABBB-7

要旨

Rippling is a type of rewriting developed for inductive theorem proving that
uses annotations to direct search. 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 it
has the formal properties desired of rippling. We then develop the 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.