The following pages link to Thomas Schneider (Q393136):
Displaying 10 items.
- Generalized satisfiability for the description logic \(\mathcal{ALC}\) (Q393137) (← links)
- Complexity of hybrid logics over transitive frames (Q631089) (← links)
- The complexity of hybrid logics over equivalence relations (Q1047797) (← links)
- Undecidability of Multi-modal Hybrid Logics (Q2867946) (← links)
- The tractability of model checking for LTL (Q2946630) (← links)
- Correctness and Worst-Case Optimality of Pratt-Style Decision Procedures for Modal and Hybrid Logics (Q3010369) (← links)
- Generalized Satisfiability for the Description Logic $\mathcal{ALC}$ (Q3010434) (← links)
- The Complexity of Generalized Satisfiability for Linear Temporal Logic (Q3623013) (← links)
- The Tractability of Model-checking for LTL: The Good, the Bad, and the Ugly Fragments (Q4982126) (← links)
- The Complexity of Generalized Satisfiability for Linear Temporal Logic (Q5758057) (← links)
