Combining matching algorithms: The regular case

Authors:
Tobias Nipkow
Affiliations:
University of Cambridge Computer Laboratory Pembroke Street Cambridge CB2 3QG England
Venue:
Journal of Symbolic Computation
Year:
1991

Citing 14
Cited 13

Completion of a set of rules modulo a set of equations

SIAM Journal on Computing
Unification in combinations of collapse-free theories with disjoint sets of function symbols

Proc. of the 8th international conference on Automated deduction
Combination of unification algorithms

Proc. of the 8th international conference on Automated deduction
Unification in combinations of collapse-free regular theories

Journal of Symbolic Computation
Unification theory

Journal of Symbolic Computation
Unification in a combination of arbitrary disjoint equational theories

Journal of Symbolic Computation
Matching - A special case of unification?

Journal of Symbolic Computation
Principles of OBJ2

POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems: Abstract Properties and Applications to Term Rewriting Systems

Journal of the ACM (JACM)
Complete Sets of Reductions for Some Equational Theories

Journal of the ACM (JACM)
An Efficient Unification Algorithm

ACM Transactions on Programming Languages and Systems (TOPLAS)
Proving termination with multiset orderings

Communications of the ACM
An Overview of LP, The Larch Power

RTA '89 Proceedings of the 3rd International Conference on Rewriting Techniques and Applications
REVE a Rewrite Rule Laboratory

Proceedings of the 8th International Conference on Automated Deduction

Maude: specification and programming in rewriting logic

Theoretical Computer Science - Rewriting logic and its applications
Unions of non-disjoint theories and combinations of satisfiability procedures

Theoretical Computer Science
Matching with Free Function Symbols - A Simple Extension of Matching?

RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Combining word problems through rewriting in categories with products

Theoretical Computer Science - Category theory and computer science
A new combination procedure for the word problem that generalizes fusion decidability results in modal logics

Information and Computation - Special issue: Combining logical systems
Combining Proof-Producing Decision Procedures

FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
Anti-pattern Matching Modulo

Language and Automata Theory and Applications
Combination of convex theories: Modularity, deduction completeness, and explanation

Journal of Symbolic Computation
Anti-patterns for rule-based languages

Journal of Symbolic Computation
Termination modulo combinations of equational theories

FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
Connecting many-sorted structures and theories through adjoint functions

FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
Connecting many-sorted theories

CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Rule-Based Constraint Programming

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of combining matching algorithms for equational theories with disjoint signatures is studied. It is shown that the combined matching problem is in general undecidable but that it becomes decidable if all theories are regular. For the case of regular theories an efficient combination algorithm is developed. As part of that development we present a simple algorithm for solving the word problem in the combination of arbitrary equational theories with disjoint signatures.