|
JAIST Repository >
b. 情報科学研究科・情報科学系 >
b10. 学術雑誌論文等 >
b10-1. 雑誌掲載論文 >
このアイテムの引用には次の識別子を使用してください:
http://hdl.handle.net/10119/9067
|
| タイトル: | KBO Orientability |
| 著者: | Zankl, Harald
Hirokawa, Nao
Middeldorp, Aart |
| キーワード: | Knuth-Bendix order
term rewriting
termination |
| 発行日: | 2009-08 |
| 出版者: | Springer |
| 誌名: | Journal of Automated Reasoning |
| 巻: | 43 |
| 号: | 2 |
| 開始ページ: | 173 |
| 終了ページ: | 201 |
| DOI: | 10.1007/s10817-009-9131-z |
| 抄録: | This article presents three new approaches to prove termination of rewritesystems with the Knuth-Bendix order efficiently. The constraints for theweight function and for the precedence are encoded inhbox{(pseudo-)}propositional logic or linear arithmetic and theresulting formula is tested for satisfiability using dedicated solvers.Any satisfying assignment represents a weight function and a precedencesuch that the induced Knuth-Bendix order orients the rules of the encodedrewrite system from left to right. This means that in contrast to thededicated methods our approach does not directly solve the problem buttransforms it to equivalent formulations for which sophisticatedback-ends exist.In order to make all approaches complete we present a method to computeupper bounds on the weights.Furthermore, our encodings take dependency pairs into accountto increase the applicability of the order. |
| Rights: | This is the author-created version of Springer, Harald Zankl, Nao Hirokawa, and Aart Middeldorp, Journal of Automated Reasoning, 43(2), 2009, 173-201. The original publication is available at www.springerlink.com, http://dx.doi.org/10.1007/s10817-009-9131-z |
| URI: | http://hdl.handle.net/10119/9067 |
| 資料タイプ: | author |
| 出現コレクション: | b10-1. 雑誌掲載論文 (Journal Articles)
|
このアイテムのファイル:
| ファイル |
記述 |
サイズ | 形式 |
|---|
| 13943-1.pdf | | 269Kb | Adobe PDF | 見る/開く |
|
当システムに保管されているアイテムはすべて著作権により保護されています。
|
