Improving associative path orderings
- 1 January 1990
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Termination of rewriting is undecidable in the one-rvle casePublished by Springer Nature ,2005
- Extensions and comparison of simplification orderingsPublished by Springer Nature ,1989
- Termination of rewriting systems by polynomial interpretations and its implementationScience of Computer Programming, 1987
- Path of subterms ordering and recursive decomposition ordering revisitedJournal of Symbolic Computation, 1987
- Termination of rewritingJournal of Symbolic Computation, 1987
- Completion of a Set of Rules Modulo a Set of EquationsSIAM Journal on Computing, 1986
- Proving termination of associative commutative rewriting systems by rewritingPublished by Springer Nature ,1986
- Termination orderings for associative-commutative rewriting systemsJournal of Symbolic Computation, 1985
- Termination of a Set of Rules Modulo a Set of EquationsPublished by Springer Nature ,1984
- Complete Sets of Reductions for Some Equational TheoriesJournal of the ACM, 1981