Please use this identifier to cite or link to this item:
doi:10.22028/D291-41415 | Title: | On the Complexity of Simplification Orderings |
| Author(s): | Steinbach, Joachim |
| Language: | English |
| Year of Publication: | 1993 |
| Place of publication: | Kaiserslautern |
| DDC notations: | 004 Computer science, internet |
| Publikation type: | Report |
| Abstract: | Various methods for proving the termination of term rewriting systems have been 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 collection of well-known simplification orderings will be presented. |
| Link to this record: | urn:nbn:de:bsz:291--ds-414154 hdl:20.500.11880/37719 http://dx.doi.org/10.22028/D291-41415 |
| Series name: | SEKI-Report / Deutsches Forschungszentrum für Künstliche Intelligenz, DFKI [ISSN 1437-4447] |
| Series volume: | 93,18 |
| Date of registration: | 27-May-2024 |
| Faculty: | SE - Sonstige Einrichtungen |
| Department: | SE - DFKI Deutsches Forschungszentrum für Künstliche Intelligenz |
| Professorship: | SE - Sonstige |
| Collections: | SciDok - Der Wissenschaftsserver der Universität des Saarlandes |
Files for this record:
| File | Description | Size | Format | |
|---|---|---|---|---|
| SEKI-Report-SR-93-18_Steinbach_On-the-Complexity-of-Simplification-Orderings.pdf | 1,18 MB | Adobe PDF | View/Open |
Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.