Fast matching in combinations of regular equational theories
Open Access
- 31 December 1996
- journal article
- Published by Elsevier in Electronic Notes in Theoretical Computer Science
- Vol. 4, 90-109
- https://doi.org/10.1016/s1571-0661(04)00035-0
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Associative-commutative matching via bipartite graph matchingThe Computer Journal, 1995
- Associative-commutative discrimination netsPublished by Springer Nature ,1993
- Order-sorted algebra I: equational deduction for multiple inheritance, overloading, exceptions and partial operationsTheoretical Computer Science, 1992
- Conditional rewriting logic as a unified model of concurrencyTheoretical Computer Science, 1992
- Combining matching algorithms: The regular caseJournal of Symbolic Computation, 1991
- Complexity of matching problemsJournal of Symbolic Computation, 1987