Termination of rewriting systems by polynomial interpretations and its implementation (Q579930)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Publication:579930 |
scientific article; zbMATH DE number 4016194
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Termination of rewriting systems by polynomial interpretations and its implementation |
scientific article; zbMATH DE number 4016194 |
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
0.8870754241943359
0 references
0.84308922290802
0 references
0.829214334487915
0 references
0.827025294303894
0 references
0.8234419822692871
0 references
