Pages that link to "Item:Q4511543"

The following pages link to The computational complexity of hybrid temporal logics (Q4511543):

Displaying 43 items.

• Reichenbach, Prior and hybrid tense logic (Q516424) (← links)
• Rules admissible in transitive temporal logic \(\mathrm{T}_{\mathrm{S}4}\), sufficient condition (Q606997) (← links)
• The complexity of satisfiability for fragments of hybrid logic. I. (Q631087) (← links)
• Complexity of hybrid logics over transitive frames (Q631089) (← links)
• \({\mathcal E}\)-connections of abstract description systems (Q814594) (← links)
• Subject-oriented spatial logic (Q821569) (← links)
• The many faces of counts-as: A formal analysis of constitutive rules (Q931777) (← links)
• Model checking for hybrid logic (Q1047796) (← links)
• The complexity of hybrid logics over equivalence relations (Q1047797) (← links)
• Hybrid logics of separation axioms (Q1047799) (← links)
• The computational complexity of satisfiability of temporal Horn formulas in propositional linear-time temporal logic (Q1209339) (← links)
• Remarks on Gregory's ``actually'' operator (Q1610620) (← links)
• Hierarchies of modal and temporal logics with reference pointers (Q1919987) (← links)
• On the expressive power of hybrid branching-time logics (Q1989342) (← links)
• Computational complexity of hybrid interval temporal logics (Q2084954) (← links)
• On the expressiveness of TPTL and MTL (Q2266987) (← links)
• Hybrid fragments of Halpern-Shoham logic and their expressive power (Q2334600) (← links)
• Resolution with order and selection for hybrid logics (Q2429982) (← links)
• The expressibility of fragments of hybrid graph logic on finite digraphs (Q2446549) (← links)
• Model checking hybrid logics (with an application to semistructured data) (Q2506828) (← links)
• Deciding regular grammar logics with converse through first-order logic (Q2567343) (← links)
• Hybrid logics: Characterization, interpolation and complexity (Q2758042) (← links)
• Expressiveness of hybrid temporal logic on data words (Q2825412) (← links)
• Modal expressiveness of graph properties (Q2866735) (← links)
• Undecidability of multi-modal hybrid logics (Q2867946) (← links)
• Correctness and Worst-Case Optimality of Pratt-Style Decision Procedures for Modal and Hybrid Logics (Q3010369) (← links)
• An Epistemic Logic with Hypotheses (Q3094014) (← links)
• THE EXPRESSIVE POWER OF MEMORY LOGICS (Q3094189) (← links)
• On the Hybrid Extension of CTL and CTL + (Q3182944) (← links)
• The Complexity of Satisfiability for Fragments of Hybrid Logic—Part I (Q3182957) (← links)
• Complexity and Succinctness Issues for Linear-Time Hybrid Logics (Q3532457) (← links)
• Terminating Tableaux for Hybrid Logic with the Difference Modality and Converse (Q3541703) (← links)
• An implementation of a dual tableaux system for order-of-magnitude qualitative reasoning (Q3643171) (← links)
• IV. Semantic extensions of SQEMA (Q3643312) (← links)
• Hybrid languages and temporal logic (Q4238499) (← links)
• Hybrid Tableaux for the Difference Modality (Q4982124) (← links)
• Experiments in Theorem Proving for Topological Hybrid Logic (Q4982128) (← links)
• On the expressive power of hybrid branching-time logics (Q5079784) (← links)
• (Q5101338) (← links)
• A Logical Approach to Hamiltonian Graphs (Q5178965) (← links)
• Computational Complexity of a Hybridized Horn Fragment of Halpern-Shoham Logic (Q5224503) (← links)
• A logic for metric and topology (Q5718689) (← links)
• Hybrid modal operators for definite descriptions (Q6545576) (← links)