- Record: found
- Abstract: not found
- Article: not found
A complete proof of correctness of the Knuth-Bendix completion algorithm
Read this article at
There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
Most cited references2
- Record: found
- Abstract: not found
- Article: not found
Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems: Abstract Properties and Applications to Term Rewriting Systems
Gérard Huet (1980)
- Record: found
- Abstract: not found
- Article: not found
Complete Sets of Reductions for Some Equational Theories
Mark Stickel, Gerald Peterson (1981)