Please use this identifier to cite or link to this item:
doi:10.22028/D291-40150 | Title: | Comparison of Simplification Orderings |
| Author(s): | Steinbach, Joachim |
| Language: | English |
| Year of Publication: | 1988 |
| Place of publication: | Kaiserslautern |
| Free key words: | Termination Simplification orderings Recursive path ordering Recursive decomposition ordering Path of subterms ordering Knuth-Bendix ordering |
| DDC notations: | 004 Computer science, internet |
| Publikation type: | Report |
| Abstract: | Termination is an important property of term rewriting systems. Simplification orderings are often used methods which guarantee termination. We describe the basic ideas of comparing terms and present the formal definitions and some examples of the most popular simplification orderings. A new definition of one of them is given which is simpler than the original and therefore better to handle. Furthermore, we complete the comparison found in the literature, i. e. we mark off the power (the sets of comparable terms) of the orderings. |
| Link to this record: | urn:nbn:de:bsz:291--ds-401508 hdl:20.500.11880/36227 http://dx.doi.org/10.22028/D291-40150 |
| Series name: | SEKI-Report / Deutsches Forschungszentrum für Künstliche Intelligenz, DFKI [ISSN 1437-4447] |
| Series volume: | 88,2 |
| Date of registration: | 11-Aug-2023 |
| 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-88-02_Steinbach_Comparison-of-Simplification-Orderings.pdf | 1,6 MB | Adobe PDF | View/Open |
Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.