9 citations · 23 across the 4 of their papers we have counts for
5 papers · 1 filter
On the Hybrid Extension of CTL and CTL+
Ahmet Kara, Martin Lange, Thomas Schwentick +1
The paper studies the expressivity, relative succinctness and complexity of satisfiability for hybrid extensions of the branching-time logics CTL and CTL+ by variables. Previous co…
On the Complexity of Branching-Time Logics
Volker Weber
We classify the complexity of the satisfiability problem for extensions of CTL and UB. The extensions we consider are Boolean combinations of path formulas, fairness properties, pa…
The Complexity of Satisfiability for Fragments of Hybrid Logic -- Part I
Arne Meier, Martin Mundhenk, Thomas Schneider +3
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 pa…
Complexity of Hybrid Logics over Transitive Frames
Martin Mundhenk, Thomas Schneider, Thomas Schwentick +1
This paper examines the complexity of hybrid logics over transitive frames, transitive trees, and linear frames. We show that satisfiability over transitive frames for the hybrid l…
Hybrid Branching-Time Logics
Volker Weber
Hybrid branching-time logics are introduced as extensions of CTL-like logics with state variables and the downarrow-binder. Following recent work in the linear framework, only logi…