Sciweavers

60 search results - page 1 / 12
» On the Complexity of Hybrid Logics with Binders
Sort
View
CSL
2005
Springer
13 years 10 months ago
On the Complexity of Hybrid Logics with Binders
Balder ten Cate, Massimo Franceschet
ENTCS
2007
90views more  ENTCS 2007»
13 years 4 months ago
Undecidability of Multi-modal Hybrid Logics
This paper establishes undecidability of satisfiability for multi-modal logic equipped with the hybrid binder ↓ , with respect to frame classes over which the same language wit...
Martin Mundhenk, Thomas Schneider 0002
JAPLL
2010
111views more  JAPLL 2010»
12 years 11 months ago
The complexity of satisfiability for fragments of hybrid logic - Part I
The satisfiability problem of hybrid logics with the downarrow binder is known to be undecidable. This initiated a research program on decidable and tractable fragments. In this p...
Arne Meier, Martin Mundhenk, Thomas Schneider 0002...
ENTCS
2011
125views more  ENTCS 2011»
12 years 8 months ago
A Hybrid Public Announcement Logic with Distributed Knowledge
In this paper the machinery of Hybrid Logic and the logic of public announcements are merged. In order to bring the two logics together properly the underlying hybrid logic has be...
Jens Ulrik Hansen
TIME
2003
IEEE
13 years 10 months ago
Hybrid Logics on Linear Structures: Expressivity and Complexity
We investigate expressivity and complexity of hybrid logics on linear structures. Hybrid logics are an enrichment of modal logics with certain first-order features which are algo...
Massimo Franceschet, Maarten de Rijke, Bernd-Holge...