The complexity of satisfiability for fragments of hybrid logic. I.

DOI10.1016/J.JAL.2010.08.001zbMATH Open1215.03034DBLPjournals/japll/MeierMSTWW10OpenAlexW3100064989WikidataQ57998323 ScholiaQ57998323MaRDI QIDQ631087FDOQ631087

Authors: Juan-Miguel Gracia 

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.001

Recommendations

• The Complexity of Satisfiability for Fragments of Hybrid Logic—Part I
• Computer Science Logic
• The complexity of monotone hybrid logics over linear frames and the natural numbers
• Bounded-Variable Fragments of Hybrid Logics
• Complexity of hybrid logics over transitive frames

zbMATH Keywords

complexitydecidabilitysatisfiabilityhybrid logicPost's lattice

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Decidability of theories and sets of sentences (03B25)

Cites Work

• Title not available (Why is that?)
• The complexity of satisfiability problems
• The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)
• Computer Science Logic
• Title not available (Why is that?)
• Hierarchies of modal and temporal logics with reference pointers
• The Computational Complexity of Provability in Systems of Modal Propositional Logic
• Counting quantifiers, successor relations, and logarithmic space
• Enumerating All Solutions for Constraint Satisfaction Problems
• Satisfiability problems for propositional calculi
• Representation, reasoning, and relational structures: a hybrid logic manifesto
• The complexity of satisfiability for fragments of hybrid logic. I.
• The complexity of existential quantification in concept languages.
• Title not available (Why is that?)
• The tractability of model-checking for LTL: the good, the bad, and the ugly fragments
• Generalized Modal Satisfiability
• The computational complexity of hybrid temporal logics
• The complexity of hybrid logics over equivalence relations
• Branching-time logics repeatedly referring to states
• Gap-languages and log-time complexity classes
• The complexity of poor man's logic
• 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
• Complexity of hybrid logics over transitive frames

Cited In (18)

• Generalized satisfiability for the description logic \(\mathcal{ALC}\)
• 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
• On the applicability of Post's lattice
• The expressibility of fragments of hybrid graph logic on finite digraphs
• Computational Complexity of a Hybridized Horn Fragment of Halpern-Shoham Logic
• The complexity of monotone hybrid logics over linear frames and the natural numbers
• Complexity of hybrid logics over transitive frames
• The complexity of hybrid logics over equivalence relations
• Narcissists are easy, stepmothers are hard
• Extended decision procedure for a fragment of HL with binders
• Model checking for hybrid branching-time logics
• Hybrid logics: Characterization, interpolation and complexity
• Computer Science Logic
• Parametrised complexity of satisfiability in temporal logic
• THE COMPLEXITY OF SATISFIABILITY FOR FRAGMENTS OF CTL AND CTL⋆
• Hybrid fragments of Halpern-Shoham logic and their expressive power

This page was built for publication: The complexity of satisfiability for fragments of hybrid logic. I.

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