The Complexity of Satisfiability for Fragments of Hybrid Logic—Part I

DOI10.1007/978-3-642-03816-7_50zbMath1250.03036OpenAlexW2114710125MaRDI QIDQ3182957

No author found.

Publication date: 16 October 2009

Published in: Mathematical Foundations of Computer Science 2009 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03816-7_50

zbMATH Keywords

complexitydecidabilityhybrid logicsatisfiabilityPost's lattice

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modal logic (including the logic of norms) (03B45) Decidability of theories and sets of sentences (03B25)

Related Items

The complexity of satisfiability for fragments of hybrid logic. I. ⋮ Generalized Satisfiability for the Description Logic $\mathcal{ALC}$

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of satisfiability for fragments of hybrid logic. I.
• Complexity of hybrid logics over transitive frames
• The complexity of existential quantification in concept languages.
• Gap-languages and log-time complexity classes
• Syntactic codes and grammar refinement
• Hierarchies of modal and temporal logics with reference pointers
• Tractable reasoning and efficient query answering in description logics: The DL-Lite family
• The Complexity of Poor Man's Logic
• Complexity and Succinctness Issues for Linear-Time Hybrid Logics
• Bounded-Variable Fragments of Hybrid Logics
• Enumerating All Solutions for Constraint Satisfaction Problems
• Satisfiability problems for propositional calculi
• The Computational Complexity of Provability in Systems of Modal Propositional Logic
• The computational complexity of hybrid temporal logics
• The Tractability of Model-checking for LTL: The Good, the Bad, and the Ugly Fragments
• Computer Science Logic
• The complexity of satisfiability problems
• Generalized Modal Satisfiability
• The Complexity of Generalized Satisfiability for Linear Temporal Logic