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

DOI10.1016/J.JAL.2010.08.001MaRDI QIDQ631087zbMATHOpenAlexDBLPWikidataFDO

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

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)

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

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

Cited in

(18)

• The complexity of hybrid logics over equivalence relations
• Complexity of hybrid logics over transitive frames
• Generalized satisfiability for the description logic \(\mathcal{ALC}\)
• On the applicability of Post's lattice
• Narcissists are easy, stepmothers are hard
• 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
• Extended decision procedure for a fragment of HL with binders
• The expressibility of fragments of hybrid graph logic on finite digraphs
• 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
• Hybrid logics: Characterization, interpolation and complexity
• The complexity of monotone hybrid logics over linear frames and the natural numbers
• Computer Science Logic

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)