Bounded-Variable Fragments of Hybrid Logics
From MaRDI portal
Publication:3590965
DOI10.1007/978-3-540-70918-3_48zbMath1186.03058OpenAlexW1608094044MaRDI QIDQ3590965
Volker Weber, Thomas Schwentick
Publication date: 3 September 2007
Published in: STACS 2007 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-70918-3_48
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70)
Related Items
On the Hybrid Extension of CTL and CTL + ⋮ The Complexity of Satisfiability for Fragments of Hybrid Logic—Part I ⋮ Expressiveness and succinctness of a logic of robustness ⋮ The complexity of satisfiability for fragments of hybrid logic. I. ⋮ Complexity and Succinctness Issues for Linear-Time Hybrid Logics ⋮ Unnamed Item ⋮ Hybrid and First-Order Complete Extensions of CaRet ⋮ Model checking memoryful linear-time logics over one-counter automata ⋮ Model checking for hybrid branching-time logics ⋮ Expressiveness of Hybrid Temporal Logic on Data Words ⋮ Complexity and succinctness issues for linear-time hybrid logics ⋮ Branching-time logics repeatedly referring to states