The computational complexity of hybrid temporal logics
From MaRDI portal
Publication:4511543
DOI10.1093/jigpal/8.5.653zbMath0959.03011OpenAlexW1969184283MaRDI QIDQ4511543
Carlos Areces, Maarten Marx, Patrick Blackburn
Publication date: 2 May 2001
Published in: Logic Journal of IGPL (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/jigpal/8.5.653
Complexity of computation (including implicit computational complexity) (03D15) Temporal logic (03B44)
Related Items (37)
Subject-oriented spatial logic ⋮ On the Hybrid Extension of CTL and CTL + ⋮ The Complexity of Satisfiability for Fragments of Hybrid Logic—Part I ⋮ Rules admissible in transitive temporal logic \(\mathrm{T}_{\mathrm{S}4}\), sufficient condition ⋮ The complexity of satisfiability for fragments of hybrid logic. I. ⋮ Complexity of hybrid logics over transitive frames ⋮ Resolution with order and selection for hybrid logics ⋮ The expressibility of fragments of hybrid graph logic on finite digraphs ⋮ Terminating Tableaux for Hybrid Logic with the Difference Modality and Converse ⋮ The many faces of counts-as: A formal analysis of constitutive rules ⋮ Correctness and Worst-Case Optimality of Pratt-Style Decision Procedures for Modal and Hybrid Logics ⋮ On the expressive power of hybrid branching-time logics ⋮ A logic for metric and topology ⋮ Reichenbach, Prior and hybrid tense logic ⋮ Hybrid logics: characterization, interpolation and complexity ⋮ A Logical Approach to Hamiltonian Graphs ⋮ Unnamed Item ⋮ Model checking hybrid logics (with an application to semistructured data) ⋮ Unnamed Item ⋮ Computational Complexity of a Hybridized Horn Fragment of Halpern-Shoham Logic ⋮ An Epistemic Logic with Hypotheses ⋮ THE EXPRESSIVE POWER OF MEMORY LOGICS ⋮ Expressiveness of Hybrid Temporal Logic on Data Words ⋮ An implementation of a dual tableaux system for order-of-magnitude qualitative reasoning ⋮ IV. Semantic extensions of SQEMA ⋮ Hybrid Tableaux for the Difference Modality ⋮ Experiments in Theorem Proving for Topological Hybrid Logic ⋮ Deciding regular grammar logics with converse through first-order logic ⋮ Computational complexity of hybrid interval temporal logics ⋮ Model checking for hybrid logic ⋮ The complexity of hybrid logics over equivalence relations ⋮ Hybrid logics of separation axioms ⋮ Hybrid fragments of Halpern-Shoham logic and their expressive power ⋮ Modal Expressiveness of Graph Properties ⋮ Undecidability of Multi-modal Hybrid Logics ⋮ \({\mathcal E}\)-connections of abstract description systems ⋮ Remarks on Gregory's ``actually operator
This page was built for publication: The computational complexity of hybrid temporal logics
