Path of subterms ordering and recursive decomposition ordering revisited (Q1099655)
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 4041333
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Path of subterms ordering and recursive decomposition ordering revisited |
scientific article; zbMATH DE number 4041333 |
Statements
Path of subterms ordering and recursive decomposition ordering revisited (English)
0 references
1987
0 references
The relationship between several simplification orderings is investigated: the path of subterms ordering, the recursive path ordering and the recursive decomposition ordering. The recursive decomposition ordering is improved in order to deal with more pairs of terms, and is made more efficient and easier to handle, by removing useless computations.
0 references
rewriting systems
0 references
computing of normal forms
0 references
subterms ordering
0 references
recursive path ordering
0 references
recursive decomposition ordering
0 references
0.8541581630706787
0 references
0.8261269330978394
0 references
0.8034131526947021
0 references
0.7860903739929199
0 references
