Combining matching algorithms: The regular case
Open Access
- 31 December 1991
- journal article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 12 (6) , 633-653
- https://doi.org/10.1016/s0747-7171(08)80145-9
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Matching — A special case of unification?Journal of Symbolic Computation, 1989
- Unification in a combination of arbitrary disjoint equational theoriesJournal of Symbolic Computation, 1989
- An overview of LP, the Larch ProverLecture Notes in Computer Science, 1989
- Completion of a Set of Rules Modulo a Set of EquationsSIAM Journal on Computing, 1986
- Combination of unification algorithmsPublished by Springer Nature ,1986
- REVE a rewrite rule laboratoryPublished by Springer Nature ,1986
- An Efficient Unification AlgorithmACM Transactions on Programming Languages and Systems, 1982
- Complete Sets of Reductions for Some Equational TheoriesJournal of the ACM, 1981
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting SystemsJournal of the ACM, 1980
- Proving termination with multiset orderingsCommunications of the ACM, 1979