Pages that link to "Item:Q3535618"
From MaRDI portal
The following pages link to The Complexity of Enriched Mu-Calculi (Q3535618):
Displayed 15 items.
- CTL\(^\ast\) with graded path modalities (Q1784942) (← links)
- Cycle detection in computation tree logic (Q1784962) (← links)
- Alternating-time temporal logics with linear past (Q1989330) (← links)
- Mu-calculus satisfiability with arithmetic constraints (Q2226964) (← 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)
- Reasoning About Strategies (Q2946746) (← links)
- Reasoning About Substructures and Games (Q2957764) (← links)
- The mu-calculus and Model Checking (Q3176384) (← links)
- Querying Regular Graph Patterns (Q3189642) (← links)
- Reasoning with Forest Logic Programs Using Fully Enriched Automata (Q3449217) (← links)
- Expressiveness and succinctness of a logic of robustness (Q4586143) (← links)
- Reasoning and Query Answering in Description Logics (Q4647812) (← links)
- (Q5015276) (← links)
- Presburger Büchi tree automata with applications to logics with expressive counting (Q6160751) (← links)