A parallel completion procedure for term rewriting systems
- 1 January 1992
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Parallelizing the closure computation in automated deductionPublished by Springer Nature ,1990
- Orme an implementation of completion procedures as sets of transitions rulesPublished by Springer Nature ,1990
- Completion procedures as transition rules + controlPublished by Springer Nature ,1989
- Parallel Algorithms for Term MatchingSIAM Journal on Computing, 1988
- History and basic features of the critical-pair/completion procedureJournal of Symbolic Computation, 1987
- Optimal speedups for parallel pattern matching in treesPublished by Springer Nature ,1987
- A procedure for automatically proving the termination of a set of rewrite rulesLecture Notes in Computer Science, 1985
- On the sequential nature of unificationThe Journal of Logic Programming, 1984
- Orderings for term-rewriting systemsTheoretical Computer Science, 1982
- Complete Sets of Reductions for Some Equational TheoriesJournal of the ACM, 1981