On the public citation graph

Strategy Logic with Imperfect Information

0 signed · 92 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/inco.1994.1092openalex-snapshot
Reasoning about Infinite Computations
inferredcites →https://doi.org/10.1006/inco.2000.2893openalex-snapshot
Module Checking
inferredcites →https://doi.org/10.1007/11539452_42openalex-snapshot
Synthesis of Distributed Systems from Knowledge-Based Specifications
inferredcites →https://doi.org/10.1007/3-540-45656-2_15openalex-snapshot
Decidability of Quantifed Propositional Branching Time Logics
inferredcites →https://doi.org/10.1007/978-3-540-75596-8_20openalex-snapshot
Distributed Synthesis for Alternating-Time Logics
inferredcites →https://doi.org/10.1007/978-3-642-12002-2_16openalex-snapshot
Rational Synthesis
inferredcites →https://doi.org/10.1007/978-3-642-15155-2_52openalex-snapshot
Asynchronous Omega-Regular Games with Partial Information
inferredcites →https://doi.org/10.1007/978-3-642-15205-4_25openalex-snapshot
Coordination Logic
inferredcites →https://doi.org/10.1007/978-3-662-43951-7_10openalex-snapshot
Games with a Weak Adversary
inferredcites →https://doi.org/10.1007/s00236-017-0306-5openalex-snapshot
Hierarchical information and the synthesis of distributed strategies
inferredcites →https://doi.org/10.1007/s100090050035openalex-snapshot
State space reduction using partial order techniques
inferredcites →https://doi.org/10.1007/s10458-013-9231-3openalex-snapshot
Comparing variants of strategic ability: how uncertainty and memory influence general properties of games
inferredcites →https://doi.org/10.1007/s10472-016-9508-8openalex-snapshot
Synthesis with rational environments
inferredcites →https://doi.org/10.1007/s10703-008-0064-7openalex-snapshot
Distributed synthesis for well-connected architectures
inferredcites →https://doi.org/10.1016/0022-0000(84)90034-5openalex-snapshot
The complexity of two-player games of incomplete information
inferredcites →https://doi.org/10.1016/0022-0000(89)90039-1openalex-snapshot
The complexity of reasoning about knowledge and time. I. Lower bounds
inferredcites →https://doi.org/10.1016/0304-3975(92)90090-3openalex-snapshot
Infinite trees and automaton- definable relations over ω-words
inferredcites →https://doi.org/10.1016/0304-3975(94)00214-4openalex-snapshot
Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra
inferredcites →https://doi.org/10.1016/j.artint.2020.103302openalex-snapshot
Verification of multi-agent systems with public actions against strategy logic
inferredcites →https://doi.org/10.1016/j.ic.2009.07.004openalex-snapshot
Strategy logic
inferredcites →https://doi.org/10.1016/j.ic.2009.09.006openalex-snapshot
Strategy construction for parity games with imperfect information
inferredcites →https://doi.org/10.1016/j.ic.2014.12.020openalex-snapshot
Augmenting ATL with strategy contexts
inferredcites →https://doi.org/10.1016/j.ic.2016.10.010openalex-snapshot
Nash equilibria in symmetric graph games with partial observation
inferredcites →https://doi.org/10.1016/j.ic.2016.10.012openalex-snapshot
Doomsday equilibria for omega-regular games
inferredcites →https://doi.org/10.1016/j.ic.2017.09.011openalex-snapshot
Practical verification of multi-agent systems against Slk specifications
inferredcites →https://doi.org/10.1016/j.ic.2018.02.023openalex-snapshot
Imperfect information in Reactive Modules games
inferredcites →https://doi.org/10.1016/j.ipl.2005.04.011openalex-snapshot
A decidable class of problems for control under partial observation
inferredcites →https://doi.org/10.1016/j.ipl.2016.10.005openalex-snapshot
The fixed initial credit problem for partial-observation energy games is Ack-complete
inferredcites →https://doi.org/10.1016/s0304-3975(98)00009-7openalex-snapshot
Infinite games on finitely coloured graphs with applications to automata on infinite trees
inferredcites →https://doi.org/10.1016/s0898-1221(00)00333-3openalex-snapshot
Lower bounds for multiplayer noncooperative games of incomplete information
inferredcites →https://doi.org/10.1016/s0898-1221(01)00282-6openalex-snapshot
Decision algorithms for multiplayer noncooperative games of incomplete information
inferredcites →https://doi.org/10.1016/s1571-0661(05)82604-0openalex-snapshot
Alternating-time logic with imperfect recall
inferredcites →https://doi.org/10.1017/cbo9780511973468openalex-snapshot
Lectures in Game Theory for Computer Scientists
inferredcites →https://doi.org/10.1023/a:1026171312755openalex-snapshot
Preface
inferredcites →https://doi.org/10.1090/s0002-9947-1969-0246760-1openalex-snapshot
Decidability of second-order theories and automata on infinite trees.
inferredcites →https://doi.org/10.1093/logcom/9.2.135openalex-snapshot
Augmenting branching temporal logics with existential quantification over atomic propositions
inferredcites →https://doi.org/10.1109/fscs.1990.89597openalex-snapshot
Distributed reactive systems are hard to synthesize
inferredcites →https://doi.org/10.1109/lics.2001.932514openalex-snapshot
Synthesizing distributed systems
inferredcites →https://doi.org/10.1109/lics.2005.53openalex-snapshot
Uniform Distributed Synthesis
inferredcites →https://doi.org/10.1109/lics.2017.8005136openalex-snapshot
Strategy logic with imperfect information
inferredcites →https://doi.org/10.1109/sfcs.1977.32openalex-snapshot
The temporal logic of programs
inferredcites →https://doi.org/10.1109/sfcs.1979.25openalex-snapshot
Multiple-person alternation
inferredcites →https://doi.org/10.1145/2579821openalex-snapshot
Partial-Observation Stochastic Games
inferredcites →https://doi.org/10.1145/2631917openalex-snapshot
Reasoning About Strategies
inferredcites →https://doi.org/10.1145/3209108.3209164openalex-snapshot
Rational Synthesis Under Imperfect Information
inferredcites →https://doi.org/10.1145/3233769openalex-snapshot
An Epistemic Strategy Logic
inferredcites →https://doi.org/10.1145/333979.333987openalex-snapshot
An automata-theoretic approach to branching-time model checking
inferredcites →https://doi.org/10.1145/4904.4999openalex-snapshot
“Sometimes” and “not never” revisited
inferredcites →https://doi.org/10.1145/585265.585270openalex-snapshot
Alternating-time temporal logic
inferredcites →https://doi.org/10.1145/75277.75293openalex-snapshot
On the synthesis of a reactive module
inferredcites →https://doi.org/10.1609/aaai.v26i1.8225openalex-snapshot
Symbolic Synthesis of Observability Requirements for Diagnosability
inferredcites →https://doi.org/10.2168/lmcs-10(4:17)2014openalex-snapshot
Quantified CTL: Expressiveness and Complexity
inferredcites →https://doi.org/10.2168/lmcs-11(2:9)2015openalex-snapshot
Pure Nash Equilibria in Concurrent Deterministic Games
inferredcites →https://doi.org/10.2307/2269808openalex-snapshot
Decidability and undecidability of extensions of second (first) order theory of (generalized) successor
inferredcites →https://doi.org/10.2307/2273878openalex-snapshot
Monadic second order definable relations on the binary tree
inferredcites →https://doi.org/10.2307/421091openalex-snapshot
Church's Problem Revisited
inferredcites →https://doi.org/10.24963/ijcai.2017/14openalex-snapshot
Verification of Broadcasting Multi-Agent Systems against an Epistemic Strategy Logic
inferredcites →https://doi.org/10.3166/jancl.21.93-131openalex-snapshot
An alternating-time temporal logic with knowledge, perfect recall and past: axiomatisation and model-checking
inferredcites →https://doi.org/10.4204/eptcs.119.17openalex-snapshot
Alternating-time temporal logic with finite-memory strategies
inferredcites →https://doi.org/10.4204/eptcs.146.4openalex-snapshot
Reasoning about Knowledge and Strategies: Epistemic Strategy Logic
inferredcites →https://doi.org/10.4204/eptcs.193.4openalex-snapshot
ATLsc with partial observation
inferredcites →https://doi.org/10.4230/lipics.icalp.2016.121openalex-snapshot
The Complexity of Rational Synthesis
inferredcites →https://doi.org/10.48550/arxiv.1112.6275openalex-snapshot
Reasoning About Strategies: On the Model-Checking Problem
inferredcites →https://doi.org/10.48550/arxiv.1908.02488openalex-snapshot
Dealing with imperfect information in Strategy Logic
inferredcites →https://doi.org/10.5555/1227068.1227073openalex-snapshot
Agents that Know How to Play
inferredcites →https://doi.org/10.5555/2615731.2615845openalex-snapshot
On module checking and strategies
inferredcites →https://doi.org/10.5555/2772879.2772911openalex-snapshot
Module Checking of Strategic Ability
inferredcites →https://doi.org/10.5555/3091125.3091299openalex-snapshot
Decidability Results for ATL* with Imperfect Information and Perfect Recall
inferredcites →https://doi.org/10.65109/leao7299openalex-snapshot
Natural Strategic Ability under Imperfect Information

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-031-18192-4_12openalex-snapshot
Towards the Combination of Model Checking and Runtime Verification on Multi-agent Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-43264-4_23openalex-snapshot
Pretty Good Strategies and Where to Find Them
inferred← citeshttps://doi.org/10.1007/978-3-031-43264-4_37openalex-snapshot
Reasoning About Smart Parking
inferred← citeshttps://doi.org/10.1007/978-3-031-93930-3_8openalex-snapshot
ATL for Dynamic Gaming Environments
inferred← citeshttps://doi.org/10.1007/978-981-96-7956-0_11openalex-snapshot
Reasoning in Coalition Planning
inferred← citeshttps://doi.org/10.1007/s10458-021-09521-xopenalex-snapshot
Modelling and verification of reconfigurable multi-agent systems
inferred← citeshttps://doi.org/10.1007/s10472-024-09959-1openalex-snapshot
A formal approach to attack graphs
inferred← citeshttps://doi.org/10.1016/j.arcontrol.2024.100940openalex-snapshot
Formal synthesis of controllers for safety-critical autonomous systems: Developments and challenges
inferred← citeshttps://doi.org/10.1016/j.artint.2024.104272openalex-snapshot
Formal verification and synthesis of mechanisms for social choice
inferred← citeshttps://doi.org/10.1016/j.jlamp.2026.101114openalex-snapshot
Finitely defined preference and preference indiscernibility in ATL with strategy contexts
inferred← citeshttps://doi.org/10.1145/3467001.3467003openalex-snapshot
Synthesis of equilibria in infinite-duration games on graphs
inferred← citeshttps://doi.org/10.1587/transinf.2024fcp0010openalex-snapshot
Strategies and Equilibria on Indistinguishability of Winning Objectives and Related Decision Problems
inferred← citeshttps://doi.org/10.1609/aaai.v38i9.28933openalex-snapshot
Abstraction of Situation Calculus Concurrent Game Structures
inferred← citeshttps://doi.org/10.1613/jair.1.12539openalex-snapshot
Approximating Perfect Recall when Model Checking Strategic Abilities: Theory and Applications
inferred← citeshttps://doi.org/10.24963/ijcai.2021/246openalex-snapshot
Reasoning About Agents That May Know Other Agents’ Strategies
inferred← citeshttps://doi.org/10.24963/ijcai.2023/26openalex-snapshot
Discounting in Strategy Logic
inferred← citeshttps://doi.org/10.24963/ijcai.2023/6openalex-snapshot
Scalable Verification of Strategy Logic through Three-Valued Abstraction
inferred← citeshttps://doi.org/10.24963/kr.2020/30openalex-snapshot
Nondeterministic Strategies and their Refinement in Strategy Logic
inferred← citeshttps://doi.org/10.24963/kr.2021/46openalex-snapshot
Strategic Reasoning in Automated Mechanism Design
inferred← citeshttps://doi.org/10.24963/kr.2021/5openalex-snapshot
Synthesizing Best-effort Strategies under Multiple Environment Specifications
inferred← citeshttps://doi.org/10.24963/kr.2022/14openalex-snapshot
Public and Private Affairs in Strategic Reasoning
inferred← citeshttps://doi.org/10.24963/kr.2023/71openalex-snapshot
Strategic Abilities of Forgetful Agents in Stochastic Environments
inferred← citeshttps://doi.org/10.4204/eptcs.391.8openalex-snapshot
The Impact of Strategies and Information in Model Checking for Multi-Agent Systems
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.