|
JAIST Repository >
School of Information Science >
Articles >
Journal Articles >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/10119/14220
|
| Title: | Non-E-Overlapping, Weakly Shallow, and Non-Collapsing TRSs are Confluent |
| Authors: | Sakai, Masahiko
Oyamaguchi, Michio
Ogawa, Mizuhito |
| Keywords: | Term rewriting systems
Confluence
non-left liner |
| Issue Date: | 2015-07-25 |
| Publisher: | Springer |
| Magazine name: | Lecture Notes in Computer Science |
| Volume: | 9195 |
| Start page: | 111 |
| End page: | 126 |
| DOI: | 10.1007/978-3-319-21401-6_7 |
| Abstract: | A term is weakly shallow if each defined function symbol occurs either at the root or in the ground subterms, and a term rewriting system is weakly shallow if both sides of a rewrite rule are weakly shallow. This paper proves that non-E-overlapping, weakly-shallow, and non-collapsing term rewriting systems are confluent by extending reduction graph techniques in our previous work [SO10] with towers of expansions. |
| Rights: | This is the author-created version of Springer, Masahiko Sakai, Michio Oyamaguchi, Mizuhito Ogawa, Lecture Notes in Computer Science, 9195, 2015, 111-126. The original publication is available at www.springerlink.com, http://dx.doi.org/10.1007/978-3-319-21401-6_7 |
| URI: | http://hdl.handle.net/10119/14220 |
| Material Type: | author |
| Appears in Collections: | b10-1. 雑誌掲載論文 (Journal Articles)
|
Files in This Item:
| File |
Description |
Size | Format |
|---|
| 21882.pdf | | 347Kb | Adobe PDF | View/Open |
|
All items in DSpace are protected by copyright, with all rights reserved.
|
