AC-Termination of rewrite systems: A modified Knuth-Bendix ordering
- 1 January 1990
- book chapter
- Published by Springer Nature
- p. 372-386
- https://doi.org/10.1007/3-540-53162-9_52
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Improving associative path orderingsPublished by Springer Nature ,1990
- Termination of rewriting systems by polynomial interpretations and its implementationScience of Computer Programming, 1987
- Termination of rewritingJournal of Symbolic Computation, 1987
- Completion of a Set of Rules Modulo a Set of EquationsSIAM Journal on Computing, 1986
- Termination orderings for associative-commutative rewriting systemsJournal of Symbolic Computation, 1985
- Simple Word Problems in Universal Algebras††The work reported in this paper was supported in part by the U.S. Office of Naval Research.Published by Elsevier ,1970