Termination orderings for associative-commutative rewriting systems
- 31 December 1985
- journal article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 1 (4) , 329-349
- https://doi.org/10.1016/s0747-7171(85)80019-5
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Commutation, transformation, and terminationPublished by Springer Nature ,1986
- Computing with rewrite systemsInformation and Control, 1985
- Refutational theorem proving using term-rewriting systemsArtificial Intelligence, 1985
- Orderings for term-rewriting systemsTheoretical Computer Science, 1982
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting SystemsJournal of the ACM, 1980
- A Catalogue of Canonical Term Rewriting Systems.Published by Defense Technical Information Center (DTIC) ,1980
- Equations and Rewrite Rules: A SurveyPublished by Elsevier ,1980
- A note on simplification orderingsInformation Processing Letters, 1979
- Proving termination with multiset orderingsCommunications of the ACM, 1979
- Abstract data types and software validationCommunications of the ACM, 1978