Generalized product of coalgebraic hybrid logics

Authors:
Katsuhiko Sano
Affiliations:
Department of Humanistic Informatics, Kyoto University, JSPS and Department of Computer Science, University of Leicester
Venue:
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
Year:
2011

Citing 7
Cited 0

Modal description logics: modalizing roles

Fundamenta Informaticae
Modal logic

Modal logic
Combining Terminological Logics with Tense Logic

EPIA '93 Proceedings of the 6th Portuguese Conference on Artificial Intelligence: Progress in Artificial Intelligence
Topological Perspective on the Hybrid Proof Rules

Electronic Notes in Theoretical Computer Science (ENTCS)
Coalgebraic Hybrid Logic

FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Rank-1 Modal Logics are Coalgebraic

Journal of Logic and Computation
Modular algorithms for heterogeneous modal logics

ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a modular method, called generalized product, of combining two coalgebraic hybrid logics in a parallel but non-compositional way. This is a coalgebraic generalization of a hybrid extension of product of modal logics. Our method, however, covers not only the combination of the same-type logics but also the combination of two different-type logics, e.g., graded hybrid logic and non-monotone hybrid logic. Moreover, we provide general strong completeness results for generalized products of coalgebraic hybrid logics with generic criteria.