Logic for computer science: foundations of automatic theorem proving
Logic for computer science: foundations of automatic theorem proving
Properties of independently axiomatizable bimodal logics
Journal of Symbolic Logic
Combining matching algorithms: The regular case
Journal of Symbolic Computation
Simplification by Cooperating Decision Procedures
ACM Transactions on Programming Languages and Systems (TOPLAS)
Unions of non-disjoint theories and combinations of satisfiability procedures
Theoretical Computer Science
Combination Techniques for Non-Disjoint Equational Theories
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
CADE-14 Proceedings of the 14th International Conference on Automated Deduction
Combining word problems through rewriting in categories with products
Theoretical Computer Science - Category theory and computer science
ε-connections of abstract description systems
Artificial Intelligence
Model-Theoretic Methods in Combined Constraint Satisfiability
Journal of Automated Reasoning
Fusions of description logics and abstract description systems
Journal of Artificial Intelligence Research
Sheaves, Games, and Model Completions: A Categorical Approach to Nonclassical Propositional Logics
Sheaves, Games, and Model Completions: A Categorical Approach to Nonclassical Propositional Logics
Connecting many-sorted theories
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
A comprehensive combination framework
ACM Transactions on Computational Logic (TOCL)
New results on rewrite-based satisfiability procedures
ACM Transactions on Computational Logic (TOCL)
Invited contribution: a comprehensive framework for combined decision procedures
FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
Combining data structures with nonstably infinite theories using many-sorted logic
FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
| Hi-index | 0.01 |
In a previous paper, we have introduced a general approach for connecting two many-sorted theories through connection functions that behave like homomorphisms on the shared signature, and have shown that, under appropriate algebraic conditions, decidability of the validity of universal formulae in the component theories transfers to their connection. This work generalizes decidability transfer results for so-called ε-connections of modal logics. However, in this general algebraic setting, only the most basic type of ε-connections could be handled. In the present paper, we overcome this restriction by looking at pairs of connection functions that are adjoint pairs for partial orders defined in the component theories.