Completion with history-dependent complexities for generated equations
- 1 January 1988
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Operational semantics of OBJ-3Published by Springer Nature ,1988
- On word problems in Horn theoriesPublished by Springer Nature ,1988
- Critical-pair criteria for the Knuth-Bendix completion procedurePublished by Association for Computing Machinery (ACM) ,1986
- Fair Conditional Term Rewriting Systems: Unification, Termination and ConfluencePublished by Springer Nature ,1985
- Conditional rewrite rulesTheoretical Computer Science, 1984
- A criterion for eliminating unnecessary reductions in the Knuth-Bendix algorithmACM SIGSAM Bulletin, 1983
- Proving termination with multiset orderingsCommunications of the ACM, 1979