On recursive path ordering (Q1082075): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0304-3975(85)90175-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2055323844 / rank | |||
Normal rank | |||
Revision as of 21:08, 19 March 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
