A New Approach for Combining Decision Procedure for the Word Problem, and Its Connection to the Nelson-Oppen Combination Method

Combining constraint solving

Constraints in computational logics

Unions of non-disjoint theories and combinations of satisfiability procedures

Theoretical Computer Science

Using Decision Procedures to Accelerate Domain-Specific Deductive Synthesis Systems

LOPSTR '98 Proceedings of the 8th International Workshop on Logic Programming Synthesis and Transformation

Automated Theorem Proving in a Combination of Theories with Disjoint Signatures

SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics

Deciding the Word Problem in the Union of Equational Theories Sharing Constructors

RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications

Model-Theoretic Methods in Combined Constraint Satisfiability

Journal of Automated Reasoning

A new combination procedure for the word problem that generalizes fusion decidability results in modal logics

Information and Computation - Special issue: Combining logical 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