Complexity and Succinctness Issues for Linear-Time Hybrid Logics

DOI10.1007/978-3-540-87803-2_6MaRDI QIDQ3532457zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Complexity and succinctness issues for linear-time hybrid logics
• The computational complexity of hybrid temporal logics
• Computational complexity of hybrid interval temporal logics
• Hybrid and subexponential linear logics
• The complexity of hybrid logics over equivalence relations
• Hybrid logics: Characterization, interpolation and complexity
• Hybrid linear logic, revisited
• The complexity of propositional linear temporal logics
• On the expressive power of hybrid branching-time logics
• On the expressive power of hybrid branching-time logics

Cites work

• Alternating finite automata on -words
• Bounded-Variable Fragments of Hybrid Logics
• Complexity and Succinctness Issues for Linear-Time Hybrid Logics
• Computer Science Logic
• Hierarchies of modal and temporal logics with reference pointers
• scientific article; zbMATH DE number 1215461 (Why is no real title available?)
• scientific article; zbMATH DE number 3237829 (Why is no real title available?)
• Hybrid logics: Characterization, interpolation and complexity
• Model checking hybrid logics (with an application to semistructured data)
• The complexity of propositional linear temporal logics
• The complexity of propositional linear temporal logics in simple cases

Cited in

(8)

• Complexity and succinctness issues for linear-time hybrid logics
• Hybrid and first-order complete extensions of CaRet
• The Complexity of Satisfiability for Fragments of Hybrid Logic—Part I
• Complexity and Succinctness Issues for Linear-Time Hybrid Logics
• Bounded-Variable Fragments of Hybrid Logics
• scientific article; zbMATH DE number 2090297 (Why is no real title available?)
• The complexity of monotone hybrid logics over linear frames and the natural numbers
• The complexity of satisfiability for fragments of hybrid logic. I.

This page was built for publication: Complexity and Succinctness Issues for Linear-Time Hybrid Logics

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