Towards a foundation of completion procedures as semidecision procedures
- 24 July 1995
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 146 (1-2) , 199-242
- https://doi.org/10.1016/0304-3975(94)00187-n
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- Equational inference, canonical proofs, and proof orderingsJournal of the ACM, 1994
- On rewrite programs: Semantics and relationship with prologThe Journal of Logic Programming, 1992
- Automated proofs of the moufang identities in alternative ringsJournal of Automated Reasoning, 1990
- Completion for rewriting modulo a congruenceTheoretical Computer Science, 1989
- A strong restriction of the inductive completion procedureJournal of Symbolic Computation, 1989
- Critical pair criteria for completionJournal of Symbolic Computation, 1988
- Termination of rewritingJournal of Symbolic Computation, 1987
- Computing with rewrite systemsInformation and Control, 1985
- Orderings for term-rewriting systemsTheoretical Computer Science, 1982
- Proving termination with multiset orderingsCommunications of the ACM, 1979