The complexity of hybrid logics over equivalence relations

DOI10.1007/S10849-009-9089-6MaRDI QIDQ1047797zbMATH OpenOpenAlexFDO

Authors Martin Mundhenk, Thomas Schneider

Publication date 6 January 2010

Published in Journal of Logic, Language and Information (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10849-009-9089-6

zbMATH Keywords

computational complexitydownarrow operatorhybrid logicmodel checkingsatisfiability

Mathematics Subject Classification ID

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

Recommendations

• Complexity of hybrid logics over transitive frames
• The Complexity of Satisfiability for Fragments of Hybrid Logic—Part I
• The complexity of satisfiability for fragments of hybrid logic. I.
• Computer Science Logic
• scientific article; zbMATH DE number 1424043

Cites work

• A lower complexity bound for propositional dynamic logic with intersection
• Computer Science Logic
• Domino-tiling games
• 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 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 1424043 (Why is no real title available?)
• Hybrid languages
• Model checking hybrid logics (with an application to semistructured data)
• The computational complexity of hybrid temporal logics
• The Computational Complexity of Provability in Systems of Modal Propositional Logic

Cited in

(14)

• Computing with cylindric modal logics and arrow logics, lower bounds
• Model checking hybrid logics (with an application to semistructured data)
• Relational Complexity and Higher Order Logics
• An efficient approach to nominal equalities in hybrid logic tableaux
• The Complexity of Satisfiability for Fragments of Hybrid Logic—Part I
• scientific article; zbMATH DE number 6533399 (Why is no real title available?)
• Complexity and Succinctness Issues for Linear-Time Hybrid Logics
• Computational Complexity of a Hybridized Horn Fragment of Halpern-Shoham Logic
• Computer Science Logic
• Transfer Results for Hybrid Logic. Part I: The Case Without Satisfaction Operators
• On the existential fragments of local first-order logics with data
• The complexity of satisfiability for fragments of hybrid logic. I.
• Complexity of hybrid logics over transitive frames
• On the satisfiability of local first-order logics with data

This page was built for publication: The complexity of hybrid logics over equivalence relations

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