Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.RTA.2015.223
URN: urn:nbn:de:0030-drops-51999
URL: https://drops.dagstuhl.de/opus/volltexte/2015/5199/
Kop, Cynthia ; Middeldorp, Aart ; Sternagel, Thomas
Conditional Complexity
| pdf-format: |
|
Abstract
We propose a notion of complexity for oriented conditional term rewrite systems. This notion is realistic in the sense that it measures not only successful computations but also partial computations that result in a failed rule application. A transformation to unconditional context-sensitive rewrite systems ispresented which reflects this complexity notion, as well as a technique to derive runtime and derivational complexity bounds for the latter.
BibTeX - Entry
@InProceedings{kop_et_al:LIPIcs:2015:5199,
author = {Cynthia Kop and Aart Middeldorp and Thomas Sternagel},
title = {{Conditional Complexity}},
booktitle = {26th International Conference on Rewriting Techniques and Applications (RTA 2015)},
pages = {223--240},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-85-9},
ISSN = {1868-8969},
year = {2015},
volume = {36},
editor = {Maribel Fern{\'a}ndez},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2015/5199},
URN = {urn:nbn:de:0030-drops-51999},
doi = {10.4230/LIPIcs.RTA.2015.223},
annote = {Keywords: conditional term rewriting, complexity}
}
| Keywords: | conditional term rewriting, complexity | |
| Seminar: | 26th International Conference on Rewriting Techniques and Applications (RTA 2015) | |
| Issue date: | 2015 | |
| Date of publication: | 18.06.2015 |
