On recursive path ordering (Q1082075): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q171405 |
||
| Property / author | |||
| Property / author: Paliath Narendran / rank | |||
Revision as of 04:52, 10 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On recursive path ordering |
scientific article |
Statements
On recursive path ordering (English)
0 references
1985
0 references
The ''recursive path ordering'' (RPO) scheme of Dershowitz is a powerful way of extending a partial order on a set of function symbols to a well- founded partial order on their set of terms. We prove that, given a pair of terms, the problem of deciding whether they can be made RPO- comparable, by choosing a partial order on their function symbols, is NP- complete.
0 references
term rewriting systems
0 references
termination
0 references
well-founded partial order
0 references
