Complexity of hybrid logics over transitive frames

DOI10.1016/J.JAL.2010.08.004zbMATH Open1215.03035OpenAlexW2811227589MaRDI QIDQ631089FDOQ631089

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

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

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)

Cites Work

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

Cited In (11)

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

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)