Pages that link to "Item:Q3182957"

The following pages link to The Complexity of Satisfiability for Fragments of Hybrid Logic—Part I (Q3182957):

Displaying 11 items.

• The complexity of satisfiability for fragments of hybrid logic. I. (Q631087) (← links)
• Complexity of hybrid logics over transitive frames (Q631089) (← links)
• The complexity of hybrid logics over equivalence relations (Q1047797) (← links)
• Hybrid fragments of Halpern-Shoham logic and their expressive power (Q2334600) (← links)
• Extended decision procedure for a fragment of HL with binders (Q2351423) (← links)
• The expressibility of fragments of hybrid graph logic on finite digraphs (Q2446549) (← links)
• Undecidability of multi-modal hybrid logics (Q2867946) (← links)
• Generalized Satisfiability for the Description Logic $\mathcal{ALC}$ (Q3010434) (← links)
• THE COMPLEXITY OF SATISFIABILITY FOR FRAGMENTS OF CTL AND CTL⋆ (Q3646173) (← links)
• The computational complexity of hybrid temporal logics (Q4511543) (← links)
• Computational Complexity of a Hybridized Horn Fragment of Halpern-Shoham Logic (Q5224503) (← links)