Bounded-Variable Fragments of Hybrid Logics

DOI10.1007/978-3-540-70918-3_48MaRDI QIDQ3590965zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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

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

Cited in

(16)

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

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)