On the Complexity of Simplification Orderings
- Various methods for proving the termination of term rewriting systems havebeen suggested. Most of them are based on the notion of simplification ordering.In this paper, the theoretical time complexities (of the worst cases) of a collectionof well-known simplification orderings will be presented.
Download full text files
Additional Services
| Author: | Joachim Steinbach |
|---|---|
| URN: | urn:nbn:de:hbz:386-kluedo-3283 |
| Series (Serial Number): | SEKI Report (93,18) |
| Document Type: | Preprint |
| Language of publication: | English |
| Year of Completion: | 1993 |
| Year of first Publication: | 1993 |
| Publishing Institution: | Technische Universität Kaiserslautern |
| Date of the Publication (Server): | 2000/04/03 |
| Faculties / Organisational entities: | Kaiserslautern - Fachbereich Informatik |
| DDC-Cassification: | 0 Allgemeines, Informatik, Informationswissenschaft / 004 Informatik |
| Licence (German): |  Standard gemäß KLUEDO-Leitlinien vor dem 27.05.2011 |