Combining matching algorithms: The regular case
Journal of Symbolic Computation
Causes and remedies for undecidability in arrow logics and in multi-modal logics
Arrow logic and multi-modal logic
Term rewriting and all that
Combination Techniques for Non-Disjoint Equational Theories
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
Unions of non-disjoint theories and combinations of satisfiability procedures
Theoretical Computer Science
Model-Theoretic Methods in Combined Constraint Satisfiability
Journal of Automated Reasoning
Information and Computation - Special issue: Combining logical systems
A comprehensive combination framework
ACM Transactions on Computational Logic (TOCL)
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
Union of equational theories: an algebraic approach
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Unions of equational monadic theories
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Hi-index | 0.00 |
We give an algorithm solving combined word problems (over non-necessarily disjoint signatures) based on rewriting of equivalence classes of terms. The canonical rewriting system we introduce consists of few transparent rules and is obtained by applying Knuth-Bendix completion procedure to presentations of pushouts among categories with products. It applies to pairs of theories which are both constructible over their common reduct (on which we do not make any special assumption).