Complexity and Succinctness Issues for Linear-Time Hybrid Logics

DOI10.1007/978-3-540-87803-2_6zbMath1178.03029OpenAlexW1534782707MaRDI QIDQ3532457

Laura Bozzelli, Ruggero Lanotte

Publication date: 27 October 2008

Published in: Logics in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-87803-2_6

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44) Combined logics (03B62)

Related Items (4)

The Complexity of Satisfiability for Fragments of Hybrid Logic—Part I ⋮ The complexity of satisfiability for fragments of hybrid logic. I. ⋮ Complexity and Succinctness Issues for Linear-Time Hybrid Logics ⋮ Hybrid and First-Order Complete Extensions of CaRet

Cites Work

• Unnamed Item
• Unnamed Item
• Alternating finite automata on \(\omega\)-words
• 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
• Complexity and Succinctness Issues for Linear-Time Hybrid Logics
• 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