Model-checking games for logics of imperfect information

DOI10.1016/j.tcs.2012.10.033zbMath1358.68191MaRDI QIDQ391101

Erich Grädel

Publication date: 10 January 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.10.033

zbMATH Keywords

complexity; dependence logic; team semantics; independence logic; model-checking games; second-order reachability games

Mathematics Subject Classification ID

91A80: Applications of game theory

03B60: Other nonclassical logic

68Q60: Specification and verification (program logics, model checking, etc.)

Related Items

Unnamed Item, On the complexity of team logic and its two-variable fragment, Expressivity and Complexity of Dependence Logic, Games for Inclusion Logic and Fixed-Point Logic, Parameterised complexity of model checking and satisfiability in propositional dependence logic, Complexity thresholds in inclusion logic, A double team semantics for generalized quantifiers, A complete coalition logic of temporal knowledge for multi-agent systems, A first-order coalition logic for BDI-agents, A parameterized view on the complexity of dependence logic, Enumerating teams in first-order team logics, A model-theoretic characterization of constant-depth arithmetic circuits, Relating Paths in Transition Systems: The Fall of the Modal Mu-Calculus

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A remark on negation in dependence logic
• Inclusion and exclusion dependencies in team semantics -- on some logics of imperfect information
• On definability in dependence logic
• The complexity of two-player games of incomplete information
• Henkin quantifiers and complete problems
• Algorithms for Omega-Regular Games with Imperfect Information
• Compositional semantics for a language of imperfect information
• Finite Partially‐Ordered Quantifiers
• Finite partially-ordered quantification