9 citations · 23 across the 4 of their papers we have counts for
Showing 2009Show all
3 papers · 1 filter
cs.LO2009★ 9 cited
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…
cs.LO2009★ 1 cited
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…
cs.LO2009★ 8 cited
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…