Automating the Knuth Bendix ordering (Q751830)

From MaRDI portal
Revision as of 05:30, 5 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Automating the Knuth Bendix ordering
scientific article

    Statements

    Automating the Knuth Bendix ordering (English)
    0 references
    0 references
    0 references
    0 references
    1990
    0 references
    The paper describes an algorithm that automatically constructs a Knuth- Bendix ordering for a finite system of terms rewriting rules if one such exists. The algorithm is based on a practical and simple algorithm to solve systems of linear inequalities.
    0 references
    completion algorithm
    0 references
    Knuth-Bendix ordering
    0 references

    Identifiers