Termination of rewriting systems by polynomial interpretations and its implementation (Q579930): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 01:41, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Termination of rewriting systems by polynomial interpretations and its implementation |
scientific article |
Statements
Termination of rewriting systems by polynomial interpretations and its implementation (English)
0 references
1987
0 references
This paper describes the actual implementation in the rewrite rule laboratory REVE of an elementary procedure that checks inequalities between polynomials and is used for proving termination of rewriting systems, especially in the more difficult case of associative-commutative rewriting systems, for which a complete characterization is given.
0 references
rewrite rule laboratory REVE
0 references
inequalities between polynomials
0 references
termination of rewriting systems
0 references
