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)
Cooperation of Background Reasoners in Theory Reasoning by Residue Sharing
Journal of Automated Reasoning
Unions of non-disjoint theories and combinations of satisfiability procedures
Theoretical Computer Science
Combining Multisets with Integers
CADE-18 Proceedings of the 18th International Conference on Automated Deduction
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
A comprehensive combination framework
ACM Transactions on Computational Logic (TOCL)
Decision procedures for algebraic data types with abstractions
Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Invited contribution: a comprehensive framework for combined decision procedures
FroCoS'05 Proceedings of the 5th 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
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.00 |
Basically, the connection of two many-sorted theories is obtained by taking their disjoint union, and then connecting the two parts through connection functions that must behave like homomorphisms on the shared signature. We determine conditions under which decidability of the validity of universal formulae in the component theories transfers to their connection. In addition, we consider variants of the basic connection scheme.