Automating the Knuth Bendix ordering (Q751830)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4178778
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Automating the Knuth Bendix ordering |
scientific article; zbMATH DE number 4178778 |
Statements
Automating the Knuth Bendix ordering (English)
0 references
1990
0 references
The paper describes an algorithm that automatically constructs a Knuth- Bendix ordering for a finite system of terms rewriting rules if one such exists. The algorithm is based on a practical and simple algorithm to solve systems of linear inequalities.
0 references
completion algorithm
0 references
Knuth-Bendix ordering
0 references
0.804926872253418
0 references
0.8039015531539917
0 references
0.8019154667854309
0 references
