A complete proof of correctness of the Knuth-Bendix completion algorithm (Q1154801): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: New decision algorithms for finitely presented commutative semigroups / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5581665 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Complete Sets of Reductions for Some Equational Theories / rank | |||
Normal rank | |||
Latest revision as of 12:49, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A complete proof of correctness of the Knuth-Bendix completion algorithm |
scientific article |
Statements
A complete proof of correctness of the Knuth-Bendix completion algorithm (English)
0 references
1981
0 references
semidecision algorithm
0 references
validity problem in equational theories
0 references
decision procedure
0 references
term rewriting
0 references
