Pages that link to "Item:Q1047797"

The following pages link to The complexity of hybrid logics over equivalence relations (Q1047797):

Displaying 12 items.

• The complexity of satisfiability for fragments of hybrid logic. I. (Q631087) (← links)
• Complexity of hybrid logics over transitive frames (Q631089) (← links)
• Computing with cylindric modal logics and arrow logics, lower bounds (Q1863830) (← links)
• Model checking hybrid logics (with an application to semistructured data) (Q2506828) (← links)
• Relational Complexity and Higher Order Logics (Q2807086) (← links)
• An efficient approach to nominal equalities in hybrid logic tableaux (Q2901189) (← links)
• The Complexity of Satisfiability for Fragments of Hybrid Logic—Part I (Q3182957) (← links)
• (Q3464006) (← links)
• Complexity and Succinctness Issues for Linear-Time Hybrid Logics (Q3532457) (← links)
• Computational Complexity of a Hybridized Horn Fragment of Halpern-Shoham Logic (Q5224503) (← links)
• Transfer Results for Hybrid Logic. Part I: The Case Without Satisfaction Operators (Q5477453) (← links)
• On the satisfiability of local first-order logics with data (Q6597951) (← links)