Improving associative path orderings
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3921960
- An improved general path order
- A Higher-Order Iterative Path Ordering
- Graph path orderings
- On recursive path ordering
- Iterative Lexicographic Path Orders
- Recursive Path Orderings Can Also Be Incremental
- scientific article; zbMATH DE number 2090310
- On the complexity of recursive path orderings
Cites work
- Complete Sets of Reductions for Some Equational Theories
- Completion of a Set of Rules Modulo a Set of Equations
- Extensions and comparison of simplification orderings
- scientific article; zbMATH DE number 3870640 (Why is no real title available?)
- scientific article; zbMATH DE number 3810909 (Why is no real title available?)
- scientific article; zbMATH DE number 3905845 (Why is no real title available?)
- scientific article; zbMATH DE number 4047066 (Why is no real title available?)
- scientific article; zbMATH DE number 4060699 (Why is no real title available?)
- scientific article; zbMATH DE number 3299786 (Why is no real title available?)
- Path of subterms ordering and recursive decomposition ordering revisited
- Termination of rewriting
- Termination of rewriting systems by polynomial interpretations and its implementation
- Termination orderings for associative-commutative rewriting systems
Cited in
(6)- Termination modulo equations by abstract commutation with an application to iteration
- An improved general path order
- scientific article; zbMATH DE number 3921960 (Why is no real title available?)
- Extension of the associative path ordering to a chain of associative commutative symbols
- AC-termination of rewrite systems: a modified Knuth-Bendix ordering
- A Higher-Order Iterative Path Ordering
This page was built for publication: Improving associative path orderings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6488548)
