scientific article; zbMATH DE number 1424043
zbMATH Open0942.03048MaRDI QIDQ4945233FDOQ4945233
Authors: Carlos Areces, Patrick Blackburn, Maarten Marx 
Publication date: 23 August 2000
Title of this publication is not available (Why is that?)
Recommendations
computational complexitydescription logicmodal logictemporal reasoningtense logictemporal logicundecidabilityexpressivitynominalsextended modal languageshybrid languagelabeled deduction
Modal logic (including the logic of norms) (03B45) Temporal logic (03B44) Logic in computer science (03B70) Complexity of computation (including implicit computational complexity) (03D15)
Cited In (41)
- Model checking hybrid logics (with an application to semistructured data)
- On the expressive power of hybrid branching-time logics
- Undecidability of multi-modal hybrid logics
- The Complexity of Satisfiability for Fragments of Hybrid Logic—Part I
- A Tableaux Based Decision Procedure for a Broad Class of Hybrid Formulae with Binders
- Indexical hybrid tense logic
- Coalgebraic Hybrid Logic
- \({\mathcal E}\)-connections of abstract description systems
- Title not available (Why is that?)
- On the freeze quantifier in Constraint LTL: Decidability and complexity
- Resolution with order and selection for hybrid logics
- Putting ABox updates into action
- Controlled query evaluation with open queries for a decidable relational submodel
- On the expressiveness of TPTL and MTL
- Dynamic logic with binders and its application to the development of reactive systems
- Living without Beth and Craig: Definitions and Interpolants in Description and Modal Logics with Nominals and Role Inclusions
- Global view on reactivity: switch graphs and their logics
- Complexity of hybrid logics over transitive frames
- Sequent calculi and decidability for intuitionistic hybrid logic
- Branching-time logics repeatedly referring to states
- The complexity of hybrid logics over equivalence relations
- Complexity and succinctness issues for linear-time hybrid logics
- A Logical Approach to Hamiltonian Graphs
- The computational complexity of hybrid temporal logics
- A tableau based decision procedure for an expressive fragment of hybrid logic with binders, converse and global modalities
- On the expressive power of first-order modal logic with two-dimensional operators
- A family of dynamic description logics for representing and reasoning about actions
- Foundations of instance level updates in expressive description logics
- Narcissists are easy, stepmothers are hard
- A logic for the stepwise development of reactive systems
- Hybrid logic meets IF modal logic
- A prover dealing with nominals, binders, transitivity and relation hierarchies
- Higher-order syntax and saturation algorithms for hybrid logic
- Global and local graph modifiers
- Relation-changing logics as fragments of hybrid logics
- Testing XML constraint satisfiability
- Computational complexity of hybrid interval temporal logics
- HTab: a terminating tableaux system for hybrid logic
- Hybrid logics: Characterization, interpolation and complexity
- Hybrid modal operators for definite descriptions
- Computer Science Logic
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4945233)
