A raod-map on complexity for hybrid logics

DOI10.1007/3-540-48168-0_22MaRDI QIDQ4945233zbMATH OpenFDO

Authors Carlos Areces, Patrick Blackburn, Maarten Marx

Publication date 23 August 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-48168-0_22

zbMATH Keywords

computational complexitydescription logicexpressivityextended modal languageshybrid languagelabeled deductionmodal logicnominalstemporal logictemporal reasoningtense logicundecidability

Mathematics Subject Classification ID

Temporal logic (03B44) Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Complexity of computation (including implicit computational complexity) (03D15)

Recommendations

• The computational complexity of hybrid temporal logics
• Deductive systems and the decidability problem for hybrid logics
• Computer Science Logic
• scientific article; zbMATH DE number 2090297
• scientific article; zbMATH DE number 1215461

Cited in

(47)

• Complexity and succinctness issues for linear-time hybrid logics
• The complexity of hybrid logics over equivalence relations
• Hybrid logic meets IF modal logic
• Branching-time logics repeatedly referring to states
• Hybridizing concept languages
• A logic for the stepwise development of reactive systems
• Global view on reactivity: switch graphs and their logics
• On the expressive power of hybrid branching-time logics
• Computational complexity of hybrid interval temporal logics
• On the expressive power of first-order modal logic with two-dimensional operators
• On the expressiveness of TPTL and MTL
• A prover dealing with nominals, binders, transitivity and relation hierarchies
• A tableau based decision procedure for an expressive fragment of hybrid logic with binders, converse and global modalities
• Controlled query evaluation with open queries for a decidable relational submodel
• A family of dynamic description logics for representing and reasoning about actions
• Resolution with order and selection for hybrid logics
• Model checking hybrid logics (with an application to semistructured data)
• Hybrid logics: Characterization, interpolation and complexity
• Higher-order syntax and saturation algorithms for hybrid logic
• Undecidability of multi-modal hybrid logics
• Testing XML constraint satisfiability
• Narcissists are easy, stepmothers are hard
• A Tableaux Based Decision Procedure for a Broad Class of Hybrid Formulae with Binders
• Dynamic logic with binders and its application to the development of reactive systems
• The Complexity of Satisfiability for Fragments of Hybrid Logic—Part I
• Coalgebraic Hybrid Logic
• Putting ABox updates into action
• Foundations of instance level updates in expressive description logics
• Hybrid completeness
• scientific article; zbMATH DE number 1215461 (Why is no real title available?)
• The computational complexity of hybrid temporal logics
• scientific article; zbMATH DE number 2090297 (Why is no real title available?)
• HTab: a terminating tableaux system for hybrid logic
• Global and local graph modifiers
• Relation-changing logics as fragments of hybrid logics
• A Logical Approach to Hamiltonian Graphs
• Computer Science Logic
• Indexical hybrid tense logic
• Living without Beth and Craig: Definitions and Interpolants in Description and Modal Logics with Nominals and Role Inclusions
• Complexity of hybrid logics over transitive frames
• Hybrid modal operators for definite descriptions
• Categorial modal realism
• Completeness of tableau calculi for two-dimensional hybrid logics
• A Lindström theorem for the hybrid logic \(\mathcal{H}(\exists)\)
• Sequent calculi and decidability for intuitionistic hybrid logic
• \({\mathcal E}\)-connections of abstract description systems
• On the freeze quantifier in Constraint LTL: Decidability and complexity

This page was built for publication: A raod-map on complexity for hybrid logics

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