| Publication type: |
Article in Proceedings |
| Author: |
Rob Myers, Dirk Pattinson, Lutz Schröder |
| Editor: |
Luca de Alfaro |
| Title: |
Coalgebraic Hybrid Logic |
| Book / Collection title: |
Foundations of Software Science and Computation Structures (FOSSACS 2009) |
| Volume: |
5504 |
| Page(s): |
137 – 151 |
| Series: |
Lecture Notes in Computer Science |
| Year published: |
2009 |
| Publisher: |
Springer |
| Abstract: |
We introduce a generic framework for hybrid logics, i.e. modal
logics additionally featuring nominals and satisfaction operators, thus providing the necessary facilities for reasoning about individual states in a model. This framework, coalgebraic hybrid logic, works at the same level of generality as coalgebraic modal logic, and in particular subsumes, besides normal hybrid logics such as hybrid K, a wide variety of logics with non-normal modal operators such as probabilistic, graded, or coalitional modalities and non-monotonic conditionals. We prove a generic finite model property and an ensuing weak completeness result, and we give a semantic criterion for decidability in PSPACE. Moreover, we present a fully internalised PSPACE tableau calculus. These generic results are easily instantiated to particular hybrid logics and thus yield a wide range of new results, including e.g. decidability in PSPACE of probabilistic and graded hybrid logics. |
| PDF Version: |
http://www.informatik.uni-bremen.de/~lschrode/papers/chl.pdf |
| Keywords: |
coalgebra hybrid logic decision procedures polynomial space hilbert gentzen sequent tableaux |
| Status: |
Reviewed |
| Last updated: |
27. 03. 2009 |
|
 |
