Complexity and succinctness issues for linear-time hybrid logics

DOI10.1016/J.TCS.2009.08.009zbMath1187.68292OpenAlexW2055646400MaRDI QIDQ1044839

Ruggero Lanotte, Laura Bozzelli

Publication date: 15 December 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.08.009

zbMATH Keywords

hybrid logicsalternating automatacomplexity and succinctness issueslinear temporal logics \(+\) past

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Logic in artificial intelligence (68T27) Temporal logic (03B44)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Alternating finite automata on \(\omega\)-words
• Succinct representation of regular languages by Boolean automata
• Reasoning about infinite computations
• The complexity of propositional linear temporal logics in simple cases
• Hierarchies of modal and temporal logics with reference pointers
• Model checking hybrid logics (with an application to semistructured data)
• Hybrid logics: characterization, interpolation and complexity
• Bounded-Variable Fragments of Hybrid Logics
• The complexity of propositional linear temporal logics
• Computer Science Logic

This page was built for publication: Complexity and succinctness issues for linear-time hybrid logics