WEKO3
アイテム
Decidability of Termination for Semi-Constructor TRSs, Left-Linear Shallow TRSs and Related Systems
http://hdl.handle.net/2237/9240
http://hdl.handle.net/2237/924012d016fa-84f1-4c8c-8b36-5e8f34ab2e34
名前 / ファイル | ライセンス | アクション |
---|---|---|
sakai_4.pdf (153.2 kB)
|
|
Item type | 学術雑誌論文 / Journal Article(1) | |||||
---|---|---|---|---|---|---|
公開日 | 2008-01-07 | |||||
タイトル | ||||||
タイトル | Decidability of Termination for Semi-Constructor TRSs, Left-Linear Shallow TRSs and Related Systems | |||||
言語 | en | |||||
著者 |
Wang, Yi
× Wang, Yi× Sakai, Masahiko |
|||||
アクセス権 | ||||||
アクセス権 | open access | |||||
アクセス権URI | http://purl.org/coar/access_right/c_abf2 | |||||
権利 | ||||||
言語 | en | |||||
権利情報 | The original publication is available at www.springerlink.com. | |||||
抄録 | ||||||
内容記述タイプ | Abstract | |||||
内容記述 | We consider several classes of term rewriting systems and prove that termination is decidable for these classes. By showing the cycling property of infinite dependency chains, we prove that termination is decidable for semi-constructor case, which is a superclass of right-ground TRSs. By analyzing argument propagation cycles in the dependency graph, we show that termination is also decidable for left-linear shallow TRSs. Moreover we extend these by combining these two techniques. | |||||
言語 | en | |||||
出版者 | ||||||
出版者 | Springer | |||||
言語 | en | |||||
言語 | ||||||
言語 | eng | |||||
資源タイプ | ||||||
資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||
資源タイプ | journal article | |||||
出版タイプ | ||||||
出版タイプ | VoR | |||||
出版タイプResource | http://purl.org/coar/version/c_970fb48d4fbd8a85 | |||||
DOI | ||||||
関連タイプ | isVersionOf | |||||
識別子タイプ | DOI | |||||
関連識別子 | https://doi.org/10.1007/11805618_26 | |||||
書誌情報 |
en : Proceedings of 17th Int'l Conference on Term Rewriting and Applications p. 343-356, 発行日 2006-09 |
|||||
フォーマット | ||||||
値 | application/pdf | |||||
著者版フラグ | ||||||
値 | publisher | |||||
URI | ||||||
識別子 | http://hdl.handle.net/2237/9240 | |||||
識別子タイプ | HDL |