Transforming derivational complexity of term rewriting to runtime complexity
Fuhs, Carsten (2019) Transforming derivational complexity of term rewriting to runtime complexity. In: Herzig, A. and Popescu, A. (eds.) Frontiers of Combining Systems 12th International Symposium, FroCoS 2019, London, UK, September 4-6, 2019, Proceedings. Lecture Notes in Artificial Intelligence 11715. Springer. (In Press)
|
Text
FroCoS19-rcdc.pdf - Author's Accepted Manuscript Download (373kB) | Preview |
Abstract
Derivational complexity of term rewriting considers the length of the longest rewrite sequence for arbitrary start terms, whereas runtime complexity restricts start terms to basic terms. Recently, there has been notable progress in automatic inference of upper and lower bounds for runtime complexity. We propose a novel transformation that allows an off-the-shelf tool for inference of upper or lower bounds for runtime complexity to be used to determine upper or lower bounds for derivational complexity as well. Our approach is applicable to derivational complexity problems for innermost rewriting and for full rewriting. We have implemented the transformation in the tool AProVE and conducted an extensive experimental evaluation. Our results indicate that bounds for derivational complexity can now be inferred for rewrite systems that have been out of reach for automated analysis thus far.
Metadata
| Item Type: | Book Section |
|---|---|
| Additional Information: | The final publication is available at Springer via the link above. |
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Carsten Fuhs |
| Date Deposited: | 23 Jul 2019 10:09 |
| Last Modified: | 09 Aug 2023 12:46 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/28185 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
 |
Edit/View Item |