Complexity of hybrid logics over transitive frames

DOI10.1016/J.JAL.2010.08.004MaRDI QIDQ631089zbMATH OpenOpenAlexFDO

Authors Martin Mundhenk, Thomas Schneider, Thomas Schwentick, V. Weber

Publication date 22 March 2011

Published in Journal of Applied Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jal.2010.08.004

zbMATH Keywords

complexitydecidabilitysatisfiabilityhybrid logic

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Modal logic (including the logic of norms) (03B45) Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15)

Recommendations

• The Complexity of Satisfiability for Fragments of Hybrid Logic—Part I
• The complexity of satisfiability for fragments of hybrid logic. I.
• The complexity of hybrid logics over equivalence relations
• The computational complexity of hybrid temporal logics
• Computer Science Logic

Cites work

• 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 1104360 (Why is no real title available?)
• scientific article; zbMATH DE number 1149405 (Why is no real title available?)
• scientific article; zbMATH DE number 1956520 (Why is no real title available?)
• scientific article; zbMATH DE number 2086420 (Why is no real title available?)
• scientific article; zbMATH DE number 757645 (Why is no real title available?)
• scientific article; zbMATH DE number 1424043 (Why is no real title available?)
• scientific article; zbMATH DE number 3271460 (Why is no real title available?)
• scientific article; zbMATH DE number 965572 (Why is no real title available?)
• scientific article; zbMATH DE number 2243392 (Why is no real title available?)
• Cardinality restrictions on concepts
• Computer Science Logic
• Computer Science Logic
• EXPTIME Tableaux with Global Caching for Description Logics with Transitive Roles, Inverse Roles and Role Hierarchies
• EXPtime tableaux for ALC
• Guarded fragments with constants
• Hierarchies of modal and temporal logics with reference pointers
• Hybrid languages
• Hybrid languages and temporal logic
• Hybrid logics: Characterization, interpolation and complexity
• Modal characterisation theorems over special classes of frames
• Modal logic
• Model checking hybrid logics (with an application to semistructured data)
• On the Finite Satisfiability Problem for the Guarded Fragment with Transitivity
• On the Restraining Power of Guards
• On the size of refutation Kripke models for some linear modal and tense logics
• PDL for ordered trees
• Representation, reasoning, and relational structures: a hybrid logic manifesto
• Syntactic codes and grammar refinement
• Tableau methods for modal and temporal logics
• The Computational Complexity of Provability in Systems of Modal Propositional Logic
• The complexity of propositional linear temporal logics
• The complexity of the temporal logic with ``until over general linear time
• The computational complexity of hybrid temporal logics
• Undecidability of multi-modal hybrid logics
• Uniform and non uniform strategies for tableaux calculi for modal logics

Cited in

(11)

• Branching-time logics repeatedly referring to states
• The complexity of hybrid logics over equivalence relations
• A prover dealing with nominals, binders, transitivity and relation hierarchies
• The computational complexity of hybrid temporal logics
• Transfer Results for Hybrid Logic. Part I: The Case Without Satisfaction Operators
• Model checking for hybrid branching-time logics
• The Complexity of Satisfiability for Fragments of Hybrid Logic—Part I
• The complexity of satisfiability for fragments of hybrid logic. I.
• Computational Complexity of a Hybridized Horn Fragment of Halpern-Shoham Logic
• Undecidability of multi-modal hybrid logics
• The complexity of monotone hybrid logics over linear frames and the natural numbers

This page was built for publication: Complexity of hybrid logics over transitive frames

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