scientific article; zbMATH DE number 1424043
From MaRDI portal
Publication:4945233
zbMath0942.03048MaRDI QIDQ4945233
Carlos Areces, Patrick Blackburn, Maarten Marx
Publication date: 23 August 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computational complexityundecidabilitymodal logictense logictemporal logicdescription logictemporal reasoningexpressivitynominalsextended modal languageshybrid languagelabeled deduction
Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Complexity of computation (including implicit computational complexity) (03D15) Temporal logic (03B44)
Related Items
Dynamic Logic with Binders and Its Application to the Development of Reactive Systems ⋮ The Complexity of Satisfiability for Fragments of Hybrid Logic—Part I ⋮ Controlled query evaluation with open queries for a decidable relational submodel ⋮ A family of dynamic description logics for representing and reasoning about actions ⋮ On the freeze quantifier in Constraint LTL: Decidability and complexity ⋮ Global view on reactivity: switch graphs and their logics ⋮ Living without Beth and Craig: Definitions and Interpolants in Description and Modal Logics with Nominals and Role Inclusions ⋮ Foundations of instance level updates in expressive description logics ⋮ Complexity of hybrid logics over transitive frames ⋮ Resolution with order and selection for hybrid logics ⋮ Unnamed Item ⋮ On the expressive power of first-order modal logic with two-dimensional operators ⋮ A Tableaux Based Decision Procedure for a Broad Class of Hybrid Formulae with Binders ⋮ On the expressive power of hybrid branching-time logics ⋮ A Logical Approach to Hamiltonian Graphs ⋮ A logic for the stepwise development of reactive systems ⋮ Model checking hybrid logics (with an application to semistructured data) ⋮ Coalgebraic Hybrid Logic ⋮ A prover dealing with nominals, binders, transitivity and relation hierarchies ⋮ HTab: a Terminating Tableaux System for Hybrid Logic ⋮ Global and Local Graph Modifiers ⋮ Sequent calculi and decidability for intuitionistic hybrid logic ⋮ Putting ABox Updates into Action ⋮ The complexity of hybrid logics over equivalence relations ⋮ Hybrid logic meets IF modal logic ⋮ Branching-time logics repeatedly referring to states ⋮ Higher-Order Syntax and Saturation Algorithms for Hybrid Logic ⋮ Undecidability of Multi-modal Hybrid Logics ⋮ Testing XML constraint satisfiability ⋮ A tableau based decision procedure for an expressive fragment of hybrid logic with binders, converse and global modalities ⋮ \({\mathcal E}\)-connections of abstract description systems
