Automating the Knuth Bendix ordering (Q751830): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Ursula Martin Webb / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Matthias Jantzen / rank | |||
Normal rank | |||
Revision as of 04:27, 21 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Automating the Knuth Bendix ordering |
scientific article |
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
