Skip to search formSkip to main contentSkip to account menu
You are currently offline. Some features of the site may not work correctly.
Knuth–Bendix completion algorithm
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2000
Highly Cited
2000
We present techniques to prove termination and innermost termination of term rewriting systems automatically. In contrast to… Expand
Highly Cited
1994
Highly Cited
1994
OTTER (Organized Techniques for Theorem-proving and Effective Research) is a resolution-style theorem-proving program for first… Expand
Review
1989
Review
1989
Proving that something is a consequence of a set of axioms can be very difficult. The Knuth-Bendix completion algorithm attempts… Expand
Highly Cited
1983
Highly Cited
1983
Abstract We show that in a free F-algebra endowed with a strict order we can associate with a complete rewriting system in the… Expand
1982
1982
The process of algebraic abstract data type completion has some similarities with resolution theorem-proving. In particular, some… Expand
Highly Cited
1981
Highly Cited
1981
Abstract We give in this paper a complete description of the Knuth-Bendix completion algorithm. We prove its correctness in full… Expand
Highly Cited
1980
Highly Cited
1980
This paper gives new results, and presents old ones m a umfied formahsm, concerning ChurchRosser theorems for rewrmng systems… Expand
Highly Cited
1980
Highly Cited
1980
Fay has described in [2,3] a complete T-unification for equational theories T which possess a complete set of reductions as… Expand
Highly Cited
1979
Highly Cited
1979
A microchannel plate (MCP) is an array of 104-107 miniature electron multipliers oriented parallel to one another (fig. 1… Expand
Highly Cited
1977
Highly Cited
1977
This paper gives new results, and presents old ones in a unified formalism, concerning Church-Rosser theorems for rewriting… Expand