Sciweavers

54 search results - page 1 / 11
» Complexity of Hybrid Logics over Transitive Frames
Sort
View
CORR
2008
Springer
94views Education» more  CORR 2008»
13 years 4 months ago
Complexity of Hybrid Logics over Transitive Frames
Martin Mundhenk, Thomas Schneider 0002, Thomas Sch...
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
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
85views more  JAPLL 2010»
12 years 11 months ago
Hybrid logic with the difference modality for generalisations of graphs
We discuss recent work generalising the basic hybrid logic with the difference modality to any reasonable notion of transition. This applies equally to both subrelational transiti...
Robert S. R. Myers, Dirk Pattinson
CADE
2005
Springer
14 years 5 months ago
Temporal Logics over Transitive States
Abstract. We investigate the computational behaviour of `two-dimensional' propositional temporal logics over (N, <) (with and without the next-time operator ?) that are cap...
Boris Konev, Frank Wolter, Michael Zakharyaschev