Model-checking games for logics of imperfect information

DOI10.1016/J.TCS.2012.10.033MaRDI QIDQ391101zbMATH OpenOpenAlexFDO

Authors 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

complexityteam semanticsdependence logicindependence logicmodel-checking gamessecond-order reachability games

Mathematics Subject Classification ID

Applications of game theory (91A80) Other nonclassical logic (03B60) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Team building in dependence
• Inclusion and exclusion dependencies in team semantics -- on some logics of imperfect information
• Dynamic logics of imperfect information: from teams and games to transitions
• Imperfect information in logic and concurrent games
• Counting in team semantics

Cites work

• scientific article; zbMATH DE number 5734943 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 4118333 (Why is no real title available?)
• scientific article; zbMATH DE number 839556 (Why is no real title available?)
• scientific article; zbMATH DE number 3196255 (Why is no real title available?)
• A remark on negation in dependence logic
• Algorithms for Omega-Regular Games with Imperfect Information
• Back and forth between logic and games
• Compositional semantics for a language of imperfect information
• Dependence logic. A new approach to independence friendly logic
• Finite Partially‐Ordered Quantifiers
• Finite partially-ordered quantification
• Henkin quantifiers and complete problems
• 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

Cited in

(20)

• Games for inclusion logic and fixed-point logic
• Tractability frontier of data complexity in team semantics
• Relating paths in transition systems: the fall of the modal mu-calculus
• Dynamic logics of imperfect information: from teams and games to transitions
• Provenance analysis for logic and games
• Expressivity and Complexity of Dependence Logic
• scientific article; zbMATH DE number 5734939 (Why is no real title available?)
• Modular SAT-based techniques for reasoning tasks in team semantics
• A parameterized view on the complexity of dependence logic
• A double team semantics for generalized quantifiers
• Enumerating teams in first-order team logics
• A first-order coalition logic for BDI-agents
• Propositional dynamic logic for searching games with errors
• scientific article; zbMATH DE number 5180966 (Why is no real title available?)
• On the complexity of team logic and its two-variable fragment
• Inclusion and exclusion dependencies in team semantics -- on some logics of imperfect information
• Parameterised complexity of model checking and satisfiability in propositional dependence logic
• Complexity thresholds in inclusion logic
• Team building in dependence
• A complete coalition logic of temporal knowledge for multi-agent systems

This page was built for publication: Model-checking games for logics of imperfect information

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q391101)