Bounded-Variable Fragments of Hybrid Logics

DOI10.1007/978-3-540-70918-3_48zbMATH Open1186.03058OpenAlexW1608094044MaRDI QIDQ3590965FDOQ3590965

Authors: Thomas Schwentick, V. Weber 

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

Recommendations

• Complexity and succinctness issues for linear-time hybrid logics
• Complexity and Succinctness Issues for Linear-Time Hybrid Logics
• Computer Science Logic
• The Complexity of Satisfiability for Fragments of Hybrid Logic—Part I
• The complexity of monotone hybrid logics over linear frames and the natural numbers

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70)

Cited In (15)

• The complexity of satisfiability for fragments of hybrid logic. I.
• Model checking memoryful linear-time logics over one-counter automata
• The Complexity of Satisfiability for Fragments of Hybrid Logic—Part I
• Complexity and Succinctness Issues for Linear-Time Hybrid Logics
• Expressiveness and succinctness of a logic of robustness
• The bounded fragment and hybrid logic with polyadic modalities
• Title not available (Why is that?)
• On the Hybrid Extension of CTL and CTL +
• Hybrid and first-order complete extensions of CaRet
• Expressiveness of hybrid temporal logic on data words
• Branching-time logics repeatedly referring to states
• Complexity and succinctness issues for linear-time hybrid logics
• Model checking for hybrid logic
• Model checking for hybrid branching-time logics
• Hybrid fragments of Halpern-Shoham logic and their expressive power

This page was built for publication: Bounded-Variable Fragments of Hybrid Logics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3590965)