Pages that link to "Item:Q1155046"

The following pages link to On the size of refutation Kripke models for some linear modal and tense logics (Q1155046):

Displaying 11 items.

• Complexity of hybrid logics over transitive frames (Q631089) (← links)
• All finitely axiomatizable tense logics of linear time flows are coNP-complete (Q817685) (← links)
• The computational complexity of the satisfiability of modal Horn clauses for modal propositional logics (Q1329742) (← links)
• Conditional logics of normality: A modal approach (Q1330670) (← links)
• The complexity of the temporal logic with ``until'' over general linear time (Q1400578) (← links)
• Backdoors for linear temporal logic (Q1725638) (← links)
• The complexity of propositional linear temporal logics in simple cases (Q1854521) (← links)
• First-order rewritability of ontology-mediated queries in linear temporal logic (Q2238711) (← links)
• Undecidability of Multi-modal Hybrid Logics (Q2867946) (← links)
• A Cookbook for Temporal Conceptual Data Modelling with Description Logics (Q2946734) (← links)
• (Q5090950) (← links)