Simple word problems in universal algebras.¶
Knuth, D. E., & Bendix, P. B. (1970). Simple word problems in universal algebras. Computational Problems in Abstract Algebra.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Well-Foundedness (Well-Ordering)
- … (Knuth-Bendix ordering, lexicographic path ordering, recursive path ordering, multiset orderings, matrix interpretations, size-change termination) has developed around the engineering of well-founded measures, with Knuth & Bendix (1970) supplying the foundational completion procedure and reduction-ordering framework.
This sourceKnuth-Bendix completion procedure and reduction-ordering framework for term-rewriting termination.
- … (Knuth-Bendix ordering, lexicographic path ordering, recursive path ordering, multiset orderings, matrix interpretations, size-change termination) has developed around the engineering of well-founded measures, with Knuth & Bendix (1970) supplying the foundational completion procedure and reduction-ordering framework.
Verification¶
This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.
Registry ID ref:a10585c050e3 · see in the full table