The computational complexity of hybrid temporal logics

DOI10.1093/JIGPAL/8.5.653zbMATH Open0959.03011OpenAlexW1969184283MaRDI QIDQ4511543FDOQ4511543

Authors: Carlos Areces, Patrick Blackburn, Maarten Marx 

Publication date: 2 May 2001

Published in: Logic Journal of the IGPL (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/jigpal/8.5.653

Recommendations

• scientific article; zbMATH DE number 1424043
• The Complexity of Satisfiability for Fragments of Hybrid Logic—Part I
• Computational complexity of hybrid interval temporal logics
• Complexity of hybrid logics over transitive frames
• Computational Complexity of a Hybridized Horn Fragment of Halpern-Shoham Logic

zbMATH Keywords

computational complexitytemporal logichybrid logicsatisfiability problem

Mathematics Subject Classification ID

Temporal logic (03B44) Complexity of computation (including implicit computational complexity) (03D15)

Cited In (45)

• Subject-oriented spatial logic
• Model checking hybrid logics (with an application to semistructured data)
• The complexity of satisfiability for fragments of hybrid logic. I.
• On the expressive power of hybrid branching-time logics
• On the expressive power of hybrid branching-time logics
• Title not available (Why is that?)
• Undecidability of multi-modal hybrid logics
• Title not available (Why is that?)
• Rules admissible in transitive temporal logic \(\mathrm{T}_{\mathrm{S}4}\), sufficient condition
• Remarks on Gregory's ``actually operator
• The Complexity of Satisfiability for Fragments of Hybrid Logic—Part I
• An implementation of a dual tableaux system for order-of-magnitude qualitative reasoning
• Indexical hybrid tense logic
• Deciding regular grammar logics with converse through first-order logic
• The many faces of counts-as: A formal analysis of constitutive rules
• Complexity and Succinctness Issues for Linear-Time Hybrid Logics
• Terminating Tableaux for Hybrid Logic with the Difference Modality and Converse
• A logic for metric and topology
• IV. Semantic extensions of SQEMA
• \({\mathcal E}\)-connections of abstract description systems
• On the Hybrid Extension of CTL and CTL +
• The expressibility of fragments of hybrid graph logic on finite digraphs
• Hybrid languages and temporal logic
• Resolution with order and selection for hybrid logics
• Modal expressiveness of graph properties
• On the expressiveness of TPTL and MTL
• Computational Complexity of a Hybridized Horn Fragment of Halpern-Shoham Logic
• Correctness and worst-case optimality of Pratt-style decision procedures for modal and hybrid logics
• Complexity of hybrid logics over transitive frames
• Expressiveness of hybrid temporal logic on data words
• The expressive power of memory logics
• Hybrid logics of separation axioms
• The complexity of hybrid logics over equivalence relations
• Model checking for hybrid logic
• A Logical Approach to Hamiltonian Graphs
• The computational complexity of satisfiability of temporal Horn formulas in propositional linear-time temporal logic
• Hierarchies of modal and temporal logics with reference pointers
• Hybrid tableaux for the difference modality
• Computational complexity of hybrid interval temporal logics
• Experiments in theorem proving for topological hybrid logic
• Reichenbach, Prior and hybrid tense logic
• Hybrid logics: Characterization, interpolation and complexity
• Hybrid modal operators for definite descriptions
• An epistemic logic with hypotheses
• Hybrid fragments of Halpern-Shoham logic and their expressive power

This page was built for publication: The computational complexity of hybrid temporal logics

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