No label defined (Q3976057)
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 18651
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 18651 |
Statements
26 June 1992
0 references
termination
0 references
AC rewriting systems
0 references
0.9069369435310364
0 references
0.8740193247795105
0 references
0.872638463973999
0 references
0.8518074154853821
0 references
[For the entire collection see Zbl 0731.00025.] The authors introduce a new order proving termination of rewrite systems that are appropriate for associative-commutative (AC) operations. As shown by a number of examples, termination can be now established for a larger class of AC rewriting systems than one can do using, say, lexicographic recursive path ordering. Their method does not impose any restriction on the precedence relation for function symbols.
0 references
