The following pages link to (Q4809076):
Displayed 21 items.
- On the undecidability of logics with converse, nominals, recursion and counting (Q814615) (← links)
- Decidability of SHIQ with complex role inclusion axioms (Q814639) (← links)
- XML schema, tree logic and sheaves automata (Q862561) (← links)
- Graded modalities in strategy logic (Q1641034) (← links)
- Reasoning about graded strategy quantifiers (Q1706169) (← links)
- Completeness for \(\mu\)-calculi: a coalgebraic approach (Q1731842) (← links)
- Sublogics of a branching time logic of robustness (Q1740655) (← links)
- Multitree automata that count (Q1770418) (← links)
- CTL\(^\ast\) with graded path modalities (Q1784942) (← links)
- Quasipolynomial computation of nested fixpoints (Q2044189) (← links)
- Answering regular path queries in expressive description logics via alternating tree-automata (Q2252521) (← links)
- Model-checking graded computation-tree logic with finite path semantics (Q2285155) (← links)
- The model checking fingerprints of CTL operators (Q2317834) (← links)
- Complexity of modal logics with Presburger constraints (Q2638188) (← links)
- Reasoning About Strategies (Q2946746) (← links)
- Reasoning About Substructures and Games (Q2957764) (← links)
- Enriched μ–Calculus Pushdown Module Checking (Q3498485) (← links)
- CTL Model-Checking with Graded Quantifiers (Q3540061) (← links)
- EXPTIME Tableaux for the Coalgebraic μ-Calculus (Q3644748) (← links)
- Expressiveness and succinctness of a logic of robustness (Q4586143) (← links)
- (Q5875397) (← links)