Pages that link to "Item:Q391101"
From MaRDI portal
The following pages link to Model-checking games for logics of imperfect information (Q391101):
Displaying 21 items.
- A double team semantics for generalized quantifiers (Q302243) (← links)
- Propositional dynamic logic for searching games with errors (Q472791) (← links)
- Inclusion and exclusion dependencies in team semantics -- on some logics of imperfect information (Q645985) (← links)
- A complete coalition logic of temporal knowledge for multi-agent systems (Q1633064) (← links)
- A first-order coalition logic for BDI-agents (Q1712430) (← links)
- A parameterized view on the complexity of dependence logic (Q2151403) (← links)
- Enumerating teams in first-order team logics (Q2172832) (← links)
- Provenance analysis for logic and games (Q2211257) (← links)
- A model-theoretic characterization of constant-depth arithmetic circuits (Q2273012) (← links)
- Relating Paths in Transition Systems: The Fall of the Modal Mu-Calculus (Q2946334) (← links)
- Team building in dependence (Q2958518) (← links)
- Dynamic Logics of Imperfect Information: From Teams and Games to Transitions (Q3299581) (← links)
- (Q3574464) (← links)
- On the complexity of team logic and its two-variable fragment (Q5005127) (← links)
- (Q5013879) (← links)
- Expressivity and Complexity of Dependence Logic (Q5213639) (← links)
- Games for Inclusion Logic and Fixed-Point Logic (Q5213642) (← links)
- (Q5755193) (← links)
- Parameterised complexity of model checking and satisfiability in propositional dependence logic (Q5918486) (← links)
- Complexity thresholds in inclusion logic (Q5925562) (← links)
- Modular SAT-based techniques for reasoning tasks in team semantics (Q6615313) (← links)
