A new method for proving termination of AC-rewrite systems
- 1 January 1990
- book chapter
- Published by Springer Nature
- p. 133-148
- https://doi.org/10.1007/3-540-53487-3_40
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- On the recursive decomposition ordering with lexicographical status and other related orderingsJournal of Automated Reasoning, 1990
- Extensions and comparison of simplification orderingsPublished by Springer Nature ,1989
- Termination of rewriting systems by polynomial interpretations and its implementationScience of Computer Programming, 1987
- Termination of rewritingJournal of Symbolic Computation, 1987
- Termination orderings for associative-commutative rewriting systemsJournal of Symbolic Computation, 1985
- Complete Sets of Reductions for Some Equational TheoriesJournal of the ACM, 1981
- A Catalogue of Canonical Term Rewriting Systems.Published by Defense Technical Information Center (DTIC) ,1980