A complete proof of correctness of the Knuth-Bendix completion algorithm (Q1154801): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q55952378, #quickstatements; #temporary_batch_1705521228510 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q55952378 / rank | |||
Normal rank | |||
Revision as of 22:02, 17 January 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
