On recursive path ordering (Q1082075)

From MaRDI portal
Revision as of 01:47, 31 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
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
    0 references
    term rewriting systems
    0 references
    termination
    0 references
    well-founded partial order
    0 references