|
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/12783
|
| Title: | AC-KBO Revisited |
| Authors: | Yamada, Akihisa
Winkler, Sarah
Hirokawa, Nao
Middeldorp, Aart |
| Keywords: | Term Rewriting
Termination
Automation |
| Issue Date: | 2014-06 |
| Publisher: | Springer |
| Magazine name: | Lecture Notes in Computer Science |
| Volume: | 8475 |
| Start page: | 319 |
| End page: | 335 |
| DOI: | 10.1007/978-3-319-07151-0_20 |
| Abstract: | We consider various definitions of AC-compatible Knuth-Bendix orders. The orders of Steinbach and of Korovin and Voronkov are revisited. The former is enhanced to a more powerful AC-compatible order and we modify the latter to amend its lack of monotonicity on non-ground terms. We further present new complexity results. An extension reflecting the recent proposal of subterm coefficients in standard Knuth-Bendix orders is also given. The various orders are compared on problems in termination and completion. |
| Rights: | This is the author-created version of Springer, Akihisa Yamada, Sarah Winkler, Nao Hirokawa, and Aart Middeldorp, Lecture Notes in Computer Science, 8475, 2014, 319-335. The original publication is available at www.springerlink.com, http://dx.doi.org/10.1007/978-3-319-07151-0_20 |
| URI: | http://hdl.handle.net/10119/12783 |
| Material Type: | author |
| Appears in Collections: | b10-1. 雑誌掲載論文 (Journal Articles)
|
Files in This Item:
| File |
Description |
Size | Format |
|---|
| 20787.pdf | | 370Kb | Adobe PDF | View/Open |
|
All items in DSpace are protected by copyright, with all rights reserved.
|
