On the public citation graph

Reasoning About Strategies

0 signed · 245 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.2000.2893openalex-snapshot
Module Checking
inferredcites →https://doi.org/10.1007/3-540-12925-1openalex-snapshot
International Symposium on Programming
inferredcites →https://doi.org/10.1007/3-540-28788-4openalex-snapshot
Finite Model Theory
inferredcites →https://doi.org/10.1007/3-540-36387-4openalex-snapshot
Automata logics, and infinite games: a guide to current research
inferredcites →https://doi.org/10.1007/3-540-45620-1_34openalex-snapshot
The Complexity of the Graded μ-Calculus
inferredcites →https://doi.org/10.1007/978-1-4613-8928-6_23openalex-snapshot
On a Decision Method in Restricted Second Order Arithmetic
inferredcites →https://doi.org/10.1007/978-3-0346-0145-0_16openalex-snapshot
Semantical Considerations on Modal Logic
inferredcites →https://doi.org/10.1007/978-3-319-08867-9_34openalex-snapshot
MCMAS-SLK: A Model Checker for the Verification of Strategy Logic Specifications
inferredcites →https://doi.org/10.1007/978-3-319-09764-0_10openalex-snapshot
A Behavioral Hierarchy of Strategy Logic
inferredcites →https://doi.org/10.1007/978-3-540-70583-3_31openalex-snapshot
ATL* Satisfiability Is 2EXPTIME-Complete
inferredcites →https://doi.org/10.1007/978-3-540-75596-8_19openalex-snapshot
A Generic Constructive Solution for Concurrent Games with Expressive Constraints on Strategies
inferredcites →https://doi.org/10.1007/978-3-540-92687-0_7openalex-snapshot
ATL with Strategy Contexts and Bounded Memory
inferredcites →https://doi.org/10.1007/978-3-642-12002-2_16openalex-snapshot
Rational Synthesis
inferredcites →https://doi.org/10.1007/978-3-642-15205-4_13openalex-snapshot
Graded Computation Tree Logic with Binary Coding
inferredcites →https://doi.org/10.1007/978-3-642-15205-4_25openalex-snapshot
Coordination Logic
inferredcites →https://doi.org/10.1007/978-3-642-17511-4_21openalex-snapshot
Relentful Strategic Reasoning in Alternating-Time Temporal Logic
inferredcites →https://doi.org/10.1007/978-3-642-23217-6_31openalex-snapshot
A Temporal Logic for the Interaction of Strategies
inferredcites →https://doi.org/10.1007/978-3-642-32940-1_14openalex-snapshot
Quantified CTL: Expressiveness and Model Checking
inferredcites →https://doi.org/10.1007/978-3-642-32940-1_15openalex-snapshot
What Makes Atl* Decidable? A Decidable Fragment of Strategy Logic
inferredcites →https://doi.org/10.1007/978-3-642-36742-7_11openalex-snapshot
Model-Checking Iterated Games
inferredcites →https://doi.org/10.1007/978-3-642-40948-6_13openalex-snapshot
Reasoning about Actions Meets Strategic Logics
inferredcites →https://doi.org/10.1007/978-3-642-54013-4_5openalex-snapshot
Doomsday Equilibria for Omega-Regular Games
inferredcites →https://doi.org/10.1007/978-94-009-7066-3_1openalex-snapshot
Elementary Predicate Logic
inferredcites →https://doi.org/10.1007/978-94-015-9833-0_1openalex-snapshot
Elementary Predicate Logic
inferredcites →https://doi.org/10.1007/bfb0025774openalex-snapshot
Design and synthesis of synchronization skeletons using branching time temporal logic
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-009-9110-4openalex-snapshot
Reasoning about temporal properties of rational play
inferredcites →https://doi.org/10.1016/0165-4896(94)90005-1openalex-snapshot
Reasoning about knowledge
inferredcites →https://doi.org/10.1016/0166-218x(84)90073-8openalex-snapshot
A game of cops and robbers
inferredcites →https://doi.org/10.1016/0304-3975(82)90125-6openalex-snapshot
Results on the propositional μ-calculus
inferredcites →https://doi.org/10.1016/0304-3975(87)90008-9openalex-snapshot
The complementation problem for Büchi automata with applications to temporal logic
inferredcites →https://doi.org/10.1016/0304-3975(87)90133-2openalex-snapshot
Alternating automata on infinite trees
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/0933-3657(92)90044-popenalex-snapshot
Handbook of theoretical computer science
inferredcites →https://doi.org/10.1016/j.ic.2009.07.004openalex-snapshot
Strategy logic
inferredcites →https://doi.org/10.1016/j.ic.2012.11.005openalex-snapshot
Pushdown module checking with imperfect information
inferredcites →https://doi.org/10.1017/cbo9780511551574openalex-snapshot
Model Theory
inferredcites →https://doi.org/10.1017/s0022481200118183openalex-snapshot
1964 International congress for logic, methodology and philosophy of science
inferredcites →https://doi.org/10.1090/dimacs/031/05openalex-snapshot
Why is modal logic so robustly decidable?
inferredcites →https://doi.org/10.1090/s0002-9904-1968-12122-6openalex-snapshot
Decidability of second-order theories and automata on infinite trees
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/12.1.149openalex-snapshot
A Modal Logic for Coalitional Power in Games
inferredcites →https://doi.org/10.1109/lics.1988.5139openalex-snapshot
Weak alternating automata give a simple explanation of why most temporal and dynamic logics are decidable in exponential time
inferredcites →https://doi.org/10.1109/lics.2009.28openalex-snapshot
Graded Computation Tree Logic
inferredcites →https://doi.org/10.1109/lics.2013.32openalex-snapshot
On the Boundary of Behavioral Strategies
inferredcites →https://doi.org/10.1109/sfcs.1977.32openalex-snapshot
The temporal logic of programs
inferredcites →https://doi.org/10.1145/1324249.1324256openalex-snapshot
Alternating-time temporal logics with irrevocable strategies
inferredcites →https://doi.org/10.1145/1324249.1324285openalex-snapshot
Alternating-time temporal logic with explicit strategies
inferredcites →https://doi.org/10.1145/2287718.2287725openalex-snapshot
Graded computation tree logic
inferredcites →https://doi.org/10.1145/276698.276748openalex-snapshot
Weak alternating automata and tree automata emptiness
inferredcites →https://doi.org/10.1145/333979.333987openalex-snapshot
An automata-theoretic approach to branching-time model checking
inferredcites →https://doi.org/10.1145/360248.360251openalex-snapshot
Formal verification of parallel programs
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/73560.73582openalex-snapshot
A temporal fixpoint calculus
inferredcites →https://doi.org/10.2168/lmcs-4(3:1)2008openalex-snapshot
Enriched MU-Calculi Module Checking
inferredcites →https://doi.org/10.2168/lmcs-4(3:11)2008openalex-snapshot
The Complexity of Enriched Mu-Calculi
inferredcites →https://doi.org/10.2307/1971035openalex-snapshot
Borel Determinacy
inferredcites →https://doi.org/10.2991/978-94-91216-95-4_3openalex-snapshot
Reasoning About Strategies
inferredcites →https://doi.org/10.4204/eptcs.112.14openalex-snapshot
Towards an Updatable Strategy Logic
inferredcites →https://doi.org/10.4204/eptcs.119.18openalex-snapshot
Satisfiability of ATL with strategy contexts
inferredcites →https://doi.org/10.4204/eptcs.146.4openalex-snapshot
Reasoning about Knowledge and Strategies: Epistemic Strategy Logic
inferredcites →https://doi.org/10.4230/lipics.fsttcs.2010.120openalex-snapshot
ATL with Strategy Contexts: Expressiveness and Model Checking
inferredcites →https://doi.org/10.5555/1227068.1227073openalex-snapshot
Agents that Know How to Play
inferredcites →https://doi.org/10.5555/2591370.2591379openalex-snapshot
Substructure Temporal Logic
inferredcites →https://doi.org/10.5555/2615731.2615845openalex-snapshot
On module checking and strategies
inferredcites →https://doi.org/10.5555/2615731.2615871openalex-snapshot
Strategy games: a renewed framework
inferredcites →https://doi.org/10.5860/choice.29-2753openalex-snapshot
Game theory: analysis of conflict
inferredcites →https://doi.org/10.7551/mitpress/5803.001.0001openalex-snapshot
Reasoning About Knowledge

What points at this work

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

inferred← citeshttps://doi.org/10.1002/cpe.6043openalex-snapshot
Toward a multilevel scalable parallel Zielonka's algorithm for solving parity games
inferred← citeshttps://doi.org/10.1007/978-3-030-01713-2_12openalex-snapshot
Reasoning About Additional Winning Strategies in Two-Player Games
inferred← citeshttps://doi.org/10.1007/978-3-030-01713-2_9openalex-snapshot
Strategic Knowledge of the Past - Expressivity and Complexity
inferred← citeshttps://doi.org/10.1007/978-3-030-04612-5_2openalex-snapshot
Infinite-Duration Poorman-Bidding Games
inferred← citeshttps://doi.org/10.1007/978-3-030-63595-4_9openalex-snapshot
Strategies, Model Checking and Branching-Time Properties in Maude
inferred← citeshttps://doi.org/10.1007/978-3-030-79318-0_3openalex-snapshot
Natural Strategic Abilities in Voting Protocols
inferred← citeshttps://doi.org/10.1007/978-3-031-08740-0_5openalex-snapshot
A Game-Theoretic Approach for the Synthesis of Complex Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-21203-1_11openalex-snapshot
Assume-Guarantee Verification of Strategic Ability
inferred← citeshttps://doi.org/10.1007/978-3-031-21203-1_47openalex-snapshot
STV+AGR: Towards Verification of Strategic Ability Using Assume-Guarantee Reasoning
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_34openalex-snapshot
Capacity ATL: Reasoning About Agent Profiles and Applications to Cybersecurity
inferred← citeshttps://doi.org/10.1007/978-3-031-43264-4_9openalex-snapshot
Behavioral QLTL
inferred← citeshttps://doi.org/10.1007/978-3-031-43619-2_54openalex-snapshot
Robust Alternating-Time Temporal Logic
inferred← citeshttps://doi.org/10.1007/978-3-031-45558-2_3openalex-snapshot
A Logical Description of Priority Separable Games
inferred← citeshttps://doi.org/10.1007/978-3-031-48539-8_7openalex-snapshot
Dynamics of Causal Dependencies in Multi-agent Settings
inferred← citeshttps://doi.org/10.1007/978-3-031-55326-4_4openalex-snapshot
Coalition Alternating-Time Temporal Logic: A Logic to Find Good Coalitions to Achieve Strategic Objectives
inferred← citeshttps://doi.org/10.1007/978-3-031-71162-6_16openalex-snapshot
Learning Branching-Time Properties in CTL and ATL via Constraint Solving
inferred← citeshttps://doi.org/10.1007/978-3-031-73709-1_18openalex-snapshot
Strategies in Spatio-Temporal Logics for Multi-agent Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-77367-9_18openalex-snapshot
Theory and Practice of Quantitative ATL
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-3-032-04590-4_18openalex-snapshot
Alternating-Time Temporal Logic with Default Actions
inferred← citeshttps://doi.org/10.1007/978-3-032-06847-7_6openalex-snapshot
Efficient Model Checking for the Alternating-Time $$\mu $$-Calculus via Effectivity Frames
inferred← citeshttps://doi.org/10.1007/978-3-032-10794-7_22openalex-snapshot
Auto-Generating Visual Editors for Formal Logics with Blockly
inferred← citeshttps://doi.org/10.1007/978-3-032-39395-1_36openalex-snapshot
HANDS: A Human-Supervised Multi-agent Network for Decision Support Under Data Scarcity
inferred← citeshttps://doi.org/10.1007/978-3-319-08867-9_34openalex-snapshot
MCMAS-SLK: A Model Checker for the Verification of Strategy Logic Specifications
inferred← citeshttps://doi.org/10.1007/978-3-319-17130-2_15openalex-snapshot
Synthesis with Rational Environments
inferred← citeshttps://doi.org/10.1007/978-3-319-29473-5_4openalex-snapshot
Evaluating the Assignment of Behavioral Goals to Coalitions of Agents
inferred← citeshttps://doi.org/10.1007/978-3-319-41540-6_15openalex-snapshot
Solving Parity Games via Priority Promotion
inferred← citeshttps://doi.org/10.1007/978-3-319-68690-5_3openalex-snapshot
Model Checking Pushdown Epistemic Game Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-17511-4_21openalex-snapshot
Relentful Strategic Reasoning in Alternating-Time Temporal Logic
inferred← citeshttps://doi.org/10.1007/s00224-019-09926-yopenalex-snapshot
Dependences in Strategy Logic
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/s10458-022-09547-9openalex-snapshot
Representing and reasoning about auctions
inferred← citeshttps://doi.org/10.1007/s10458-025-09712-wopenalex-snapshot
Behavioral QLTL
inferred← citeshttps://doi.org/10.1007/s10472-016-9508-8openalex-snapshot
Synthesis with rational environments
inferred← citeshttps://doi.org/10.1007/s10472-024-09959-1openalex-snapshot
A formal approach to attack graphs
inferred← citeshttps://doi.org/10.1007/s10489-021-02658-yopenalex-snapshot
Rational verification: game-theoretic verification of multi-agent systems
inferred← citeshttps://doi.org/10.1007/s10515-021-00307-9openalex-snapshot
Model checking strategy-controlled systems in rewriting logic
inferred← citeshttps://doi.org/10.1007/s10703-018-0315-1openalex-snapshot
Solving parity games via priority promotion
inferred← citeshttps://doi.org/10.1007/s10849-022-09357-yopenalex-snapshot
A Logic for Conditional Local Strategic Reasoning
inferred← citeshttps://doi.org/10.1007/s10849-026-09457-zopenalex-snapshot
Completeness of coalition logics with seriality, independence of agents, or determinism
inferred← citeshttps://doi.org/10.1007/s11229-025-05277-zopenalex-snapshot
A logical description of priority separable games
inferred← citeshttps://doi.org/10.1016/j.artint.2017.04.003openalex-snapshot
From model checking to equilibrium checking: Reactive modules for rational verification
inferred← citeshttps://doi.org/10.1016/j.artint.2019.06.007openalex-snapshot
Knowing-how under uncertainty
inferred← citeshttps://doi.org/10.1016/j.artint.2019.103170openalex-snapshot
Natural strategic ability
inferred← citeshttps://doi.org/10.1016/j.artint.2020.103302openalex-snapshot
Verification of multi-agent systems with public actions against strategy logic
inferred← citeshttps://doi.org/10.1016/j.artint.2020.103353openalex-snapshot
Automated temporal equilibrium analysis: Verification and synthesis of multi-player games
inferred← citeshttps://doi.org/10.1016/j.artint.2020.103399openalex-snapshot
On composition of bounded-recall plans
inferred← citeshttps://doi.org/10.1016/j.artint.2021.103453openalex-snapshot
Epistemic GDL: A logic for representing and reasoning about imperfect information games
inferred← citeshttps://doi.org/10.1016/j.artint.2021.103557openalex-snapshot
Strategic reasoning with a bounded number of resources: The quest for tractability
inferred← citeshttps://doi.org/10.1016/j.artint.2022.103724openalex-snapshot
Verification of agent navigation in partially-known environments
inferred← citeshttps://doi.org/10.1016/j.artint.2022.103806openalex-snapshot
Cooperative concurrent games
inferred← citeshttps://doi.org/10.1016/j.artint.2022.103847openalex-snapshot
An abstraction-refinement framework for verifying strategic properties in multi-agent systems with imperfect information
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.artint.2026.104628openalex-snapshot
Capacity alternating-time temporal epistemic logic
inferred← citeshttps://doi.org/10.1016/j.future.2021.01.034openalex-snapshot
Evaluating verification awareness as a method for assessing adaptation risk
inferred← citeshttps://doi.org/10.1016/j.ic.2014.12.020openalex-snapshot
Augmenting ATL with strategy contexts
inferred← citeshttps://doi.org/10.1016/j.ic.2015.03.015openalex-snapshot
A logic with revocable and refinable strategies
inferred← citeshttps://doi.org/10.1016/j.ic.2016.10.010openalex-snapshot
Nash equilibria in symmetric graph games with partial observation
inferred← citeshttps://doi.org/10.1016/j.ic.2017.08.010openalex-snapshot
Reasoning about graded strategy quantifiers
inferred← citeshttps://doi.org/10.1016/j.ic.2017.09.011openalex-snapshot
Practical verification of multi-agent systems against Slk specifications
inferred← citeshttps://doi.org/10.1016/j.ic.2018.02.022openalex-snapshot
Graded modalities in Strategy Logic
inferred← citeshttps://doi.org/10.1016/j.ic.2018.02.023openalex-snapshot
Imperfect information in Reactive Modules games
inferred← citeshttps://doi.org/10.1016/j.ic.2018.09.005openalex-snapshot
A delayed promotion policy for parity games
inferred← citeshttps://doi.org/10.1016/j.ic.2018.09.007openalex-snapshot
Cycle detection in computation tree logic
inferred← citeshttps://doi.org/10.1016/j.ic.2019.104501openalex-snapshot
Robust worst cases for parity games algorithms
inferred← citeshttps://doi.org/10.1016/j.ic.2020.104552openalex-snapshot
Bisimulations for verifying strategic abilities with an application to the ThreeBallot voting protocol
inferred← citeshttps://doi.org/10.1016/j.ic.2020.104554openalex-snapshot
Game-Theoretic Semantics for ATL+ with Applications to Model Checking
inferred← citeshttps://doi.org/10.1016/j.ic.2020.104555openalex-snapshot
Multi-player games with LDL goals over finite traces
inferred← citeshttps://doi.org/10.1016/j.ic.2026.105419openalex-snapshot
Seven kinds of equivalent models for generalized coalition logics
inferred← citeshttps://doi.org/10.1016/j.ipl.2015.10.004openalex-snapshot
On the semantics of Strategy Logic
inferred← citeshttps://doi.org/10.1016/j.jlamp.2021.100700openalex-snapshot
Strategies, model checking and branching-time properties in Maude
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.06.031openalex-snapshot
Dynamic resource allocation games
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.11.028openalex-snapshot
Alternating-time temporal logics with linear past
inferred← citeshttps://doi.org/10.1093/jigpal/jzaf067openalex-snapshot
Completeness of two fragments of a logic for conditional strategic reasoning
inferred← citeshttps://doi.org/10.1093/logcom/exab032openalex-snapshot
Strategic coalitions in stochastic games
inferred← citeshttps://doi.org/10.1093/logcom/exaf059openalex-snapshot
A minimal coalition logic
inferred← citeshttps://doi.org/10.1093/logcom/exu052openalex-snapshot
Relentful strategic reasoning in alternating-time temporal logic
inferred← citeshttps://doi.org/10.1109/access.2019.2931514openalex-snapshot
Making Agents’ Abilities Explicit
inferred← citeshttps://doi.org/10.1109/csf68417.2026.00042openalex-snapshot
Active Cyber Defense Strategy through Multi-Agent Systems Verification
inferred← citeshttps://doi.org/10.1109/ickii46306.2019.9042668openalex-snapshot
Electrical Performances of Insulated Gated Bipolar Transistor on Breakdown Voltage Corresponding to the Resulted Voltage due to the Applied Current Source
inferred← citeshttps://doi.org/10.1109/ickii46306.2019.9042675openalex-snapshot
Strategy Reasoning in the Multi-agent Systems
inferred← citeshttps://doi.org/10.1109/lics.2013.32openalex-snapshot
On the Boundary of Behavioral Strategies
inferred← citeshttps://doi.org/10.1109/lics.2017.8005136openalex-snapshot
Strategy logic with imperfect information
inferred← citeshttps://doi.org/10.1109/lics56636.2023.10175832openalex-snapshot
Quantifying Over Trees in Monadic Second-Order Logic
inferred← citeshttps://doi.org/10.1109/tase.2019.000-1openalex-snapshot
Low complexity and large interactions are possible in Strategy logic
inferred← citeshttps://doi.org/10.1109/time.2015.19openalex-snapshot
On the Counting of Strategies
inferred← citeshttps://doi.org/10.1145/2603088.2603143openalex-snapshot
The complexity of admissibility in Omega-regular games
inferred← citeshttps://doi.org/10.1145/2757286openalex-snapshot
Reasoning About Substructures and Games
inferred← citeshttps://doi.org/10.1145/2970030.2970039openalex-snapshot
Expressing Receipt-Freeness and Coercion-Resistance in Logics of Strategic Ability
inferred← citeshttps://doi.org/10.1145/3309761openalex-snapshot
Reasoning about Strategic Abilities
inferred← citeshttps://doi.org/10.1145/3340295openalex-snapshot
Infinite-duration Bidding Games
inferred← citeshttps://doi.org/10.1145/3341105.3373907openalex-snapshot
Formal verification of debates in argumentation theory
inferred← citeshttps://doi.org/10.1145/3424978.3425046openalex-snapshot
Model Checking Dynamic Strategy Logic with Memoryless Strategies
inferred← citeshttps://doi.org/10.1145/3427955openalex-snapshot
Strategy Logic with Imperfect Information
inferred← citeshttps://doi.org/10.1145/3459993openalex-snapshot
Strategic Knowledge Acquisition
inferred← citeshttps://doi.org/10.1145/3467001.3467003openalex-snapshot
Synthesis of equilibria in infinite-duration games on graphs
inferred← citeshttps://doi.org/10.1145/3517128openalex-snapshot
The Temporal Logic of Coalitional Goal Assignments in Concurrent Multiplayer Games
inferred← citeshttps://doi.org/10.1145/3565365openalex-snapshot
Good-for-Game QPTL: An Alternating Hodges Semantics
inferred← citeshttps://doi.org/10.1145/3582498openalex-snapshot
Reasoning about Quality and Fuzziness of Strategic Behaviors
inferred← citeshttps://doi.org/10.1145/3651162openalex-snapshot
Stackelberg-Pareto Synthesis
inferred← citeshttps://doi.org/10.1145/3716863.3718032openalex-snapshot
Trigger-Based Discretization of Hybrid Games for Autonomous Cyber-Physical Systems
inferred← citeshttps://doi.org/10.1609/aaai.v29i1.9444openalex-snapshot
Verifying and Synthesising Multi-Agent Systems against One-Goal Strategy Logic Specifications
inferred← citeshttps://doi.org/10.1609/aaai.v33i01.33016030openalex-snapshot
An Abstraction-Based Method for Verifying Strategic Properties in Multi-Agent Systems with Imperfect Information
inferred← citeshttps://doi.org/10.1609/aaai.v34i05.6193openalex-snapshot
Model Checking Temporal Epistemic Logic under Bounded Recall
inferred← citeshttps://doi.org/10.2168/lmcs-10(4:17)2014openalex-snapshot
Quantified CTL: Expressiveness and Complexity
inferred← citeshttps://doi.org/10.2168/lmcs-11(2:9)2015openalex-snapshot
Pure Nash Equilibria in Concurrent Deterministic Games
inferred← citeshttps://doi.org/10.23638/lmcs-13(1:9)2017openalex-snapshot
Reasoning about Strategies: on the Satisfiability Problem
inferred← citeshttps://doi.org/10.23638/lmcs-17(1:10)2021openalex-snapshot
Determinacy in Discrete-Bidding Infinite-Duration Games
inferred← citeshttps://doi.org/10.24963/ijcai.2017/153openalex-snapshot
ATL Strategic Reasoning Meets Correlated Equilibrium
inferred← citeshttps://doi.org/10.24963/ijcai.2018/11openalex-snapshot
Alternating-time Temporal Logic on Finite Traces
inferred← citeshttps://doi.org/10.24963/ijcai.2019/13openalex-snapshot
Strategy Logic with Simple Goals: Tractable Reasoning about Strategies
inferred← citeshttps://doi.org/10.24963/ijcai.2019/5openalex-snapshot
Probabilistic Strategy Logic
inferred← citeshttps://doi.org/10.24963/ijcai.2020/232openalex-snapshot
Synthesizing strategies under expected and exceptional environment behaviors
inferred← citeshttps://doi.org/10.24963/ijcai.2021/243openalex-snapshot
Best-Effort Synthesis: Doing Your Best Is Not Harder Than Giving Up
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/kr.2020/10openalex-snapshot
A Three-valued Approach to Strategic Abilities under Imperfect Information
inferred← citeshttps://doi.org/10.24963/kr.2020/17openalex-snapshot
Module Checking of Pushdown Multi-agent Systems
inferred← citeshttps://doi.org/10.24963/kr.2020/3openalex-snapshot
Verifying Strategic Abilities of Neural-symbolic Multi-agent Systems
inferred← citeshttps://doi.org/10.24963/kr.2021/30openalex-snapshot
Rational Verification for Probabilistic Systems
inferred← citeshttps://doi.org/10.24963/kr.2021/46openalex-snapshot
Strategic Reasoning in Automated Mechanism Design
inferred← citeshttps://doi.org/10.3233/978-1-61499-672-9-1686openalex-snapshot
Hiding Actions in Concurrent Games
inferred← citeshttps://doi.org/10.3233/978-1-61499-672-9-408openalex-snapshot
Situation Calculus Game Structures and GDL
inferred← citeshttps://doi.org/10.3233/faia200072openalex-snapshot
Verifying Strategic Abilities in Multi-Agent Systems via First-Order Entailment
inferred← citeshttps://doi.org/10.3233/faia200437openalex-snapshot
Reasoning About Quality and Fuzziness of Strategic Behaviours
inferred← citeshttps://doi.org/10.3233/fi-2015-1235openalex-snapshot
On Promptness in Parity Games
inferred← citeshttps://doi.org/10.3233/fi-2020-1955openalex-snapshot
Multi-valued Verification of Strategic Ability
inferred← citeshttps://doi.org/10.3233/ia-221080openalex-snapshot
Attack Graphs & Subset Sabotage Games
inferred← citeshttps://doi.org/10.3233/jcs-210049openalex-snapshot
How to measure usable security: Natural strategies in voting protocols1
inferred← citeshttps://doi.org/10.3390/g9030039openalex-snapshot
An Abstraction-Refinement Methodologyfor Reasoning about Network Games†
inferred← citeshttps://doi.org/10.3390/logics1010003openalex-snapshot
Logics for Strategic Reasoning of Socially Interacting Rational Agents: An Overview and Perspectives
inferred← citeshttps://doi.org/10.3390/math9233052openalex-snapshot
Representation and Reasoning about Strategic Abilities with ω-Regular Properties
inferred← citeshttps://doi.org/10.4018/979-8-3373-9745-0.ch010openalex-snapshot
Green FinTech and Renewable Energy Transition for Climate Mitigation
inferred← citeshttps://doi.org/10.4204/eptcs.146.4openalex-snapshot
Reasoning about Knowledge and Strategies: Epistemic Strategy Logic
inferred← citeshttps://doi.org/10.4204/eptcs.218.1openalex-snapshot
Extended Graded Modalities in Strategy Logic
inferred← citeshttps://doi.org/10.4204/eptcs.218.2openalex-snapshot
Representing Strategies
inferred← citeshttps://doi.org/10.4204/eptcs.226.12openalex-snapshot
Cycle Detection in Computation Tree Logic
inferred← citeshttps://doi.org/10.4204/eptcs.256.19openalex-snapshot
On the Complexity of ATL and ATL* Module Checking
inferred← citeshttps://doi.org/10.4204/eptcs.256.9openalex-snapshot
Robust Exponential Worst Cases for Divide-et-Impera Algorithms for Parity Games
inferred← citeshttps://doi.org/10.4204/eptcs.391.8openalex-snapshot
The Impact of Strategies and Information in Model Checking for Multi-Agent Systems
inferred← citeshttps://doi.org/10.4230/lipics.concur.2015.268openalex-snapshot
Expresiveness and Complexity Results for Strategic Reasoning
inferred← citeshttps://doi.org/10.4230/lipics.csl.2015.648openalex-snapshot
Binding Forms in First-Order Logic
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2015.69openalex-snapshot
Weighted Strategy Logic with Boolean Goals Over One-Counter Games
inferred← citeshttps://doi.org/10.46298/lmcs-19(2:13)2023openalex-snapshot
HyperATL*: A Logic for Hyperproperties in Multi-Agent Systems
inferred← citeshttps://doi.org/10.48550/arxiv.1404.1531openalex-snapshot
On the Remarkable Features of Binding Forms
inferred← citeshttps://doi.org/10.48550/arxiv.1611.03524openalex-snapshot
Quantified CTL with imperfect information
inferred← citeshttps://doi.org/10.48550/arxiv.1804.04372openalex-snapshot
Infinite-Duration Poorman-Bidding Games
inferred← citeshttps://doi.org/10.48550/arxiv.1805.06881openalex-snapshot
Changing Observations in Epistemic Temporal Logic
inferred← citeshttps://doi.org/10.48550/arxiv.1908.02488openalex-snapshot
Dealing with imperfect information in Strategy Logic
inferred← citeshttps://doi.org/10.48550/arxiv.2005.01184openalex-snapshot
Algebraic classifications for fragments of first-order logic and beyond
inferred← citeshttps://doi.org/10.48550/arxiv.2008.05647openalex-snapshot
Multi-Player Games with LDL Goals over Finite Traces
inferred← citeshttps://doi.org/10.5555/2772879.2772911openalex-snapshot
Module Checking of Strategic Ability
inferred← citeshttps://doi.org/10.5555/2936924.2937026openalex-snapshot
Concurrent Multi-Player Parity Games
inferred← citeshttps://doi.org/10.5555/2936924.2937027openalex-snapshot
Graded Strategy Logic: Reasoning about Uniqueness of Nash Equilibria
inferred← citeshttps://doi.org/10.5555/3091125.3091225openalex-snapshot
Iterated Games with LDL Goals over Finite Traces
inferred← citeshttps://doi.org/10.5555/3091125.3091226openalex-snapshot
Iterated Boolean Games for Rational Verification
inferred← citeshttps://doi.org/10.5555/3091125.3091227openalex-snapshot
Reasoning about Natural Strategic Ability
inferred← citeshttps://doi.org/10.5555/3091125.3091293openalex-snapshot
Hiding Actions in Multi-Player Games
inferred← citeshttps://doi.org/10.5555/3091125.3091299openalex-snapshot
Decidability Results for ATL* with Imperfect Information and Perfect Recall
inferred← citeshttps://doi.org/10.5555/3091125.3091302openalex-snapshot
Game-Theoretic Semantics for ATL+ with Applications to Model Checking
inferred← citeshttps://doi.org/10.6092/unina/fedoa/10094openalex-snapshot
Logics for Multi-Agent Systems Verification
inferred← citeshttps://doi.org/10.6092/unina/fedoa/10355openalex-snapshot
On Games in Formal Verification
inferred← citeshttps://doi.org/10.65109/azuw6899openalex-snapshot
Enforcing Equilibria in Multi-Agent Systems
inferred← citeshttps://doi.org/10.65109/bfhy9470openalex-snapshot
Reconfigurable Interaction for MAS Modelling
inferred← citeshttps://doi.org/10.65109/bvxq7383openalex-snapshot
STV: Model Checking for Strategies under Imperfect Information
inferred← citeshttps://doi.org/10.65109/ekdq8015openalex-snapshot
Verification of Multi-agent Systems with Imperfect Information and Public Actions
inferred← citeshttps://doi.org/10.65109/fabh7822openalex-snapshot
On Domination and Control in Strategic Ability
inferred← citeshttps://doi.org/10.65109/kpbb4209openalex-snapshot
Bisimulations for Verifying Strategic Abilities with an Application to ThreeBallot
inferred← citeshttps://doi.org/10.65109/leao7299openalex-snapshot
Natural Strategic Ability under Imperfect Information
inferred← citeshttps://doi.org/10.65109/nquc1903openalex-snapshot
Decidable Verification of Multi-agent Systems with Bounded Private Actions
inferred← citeshttps://doi.org/10.65109/pjej1962openalex-snapshot
Agent-based Abstractions for Verifying Alternating-time Temporal Logic with Imperfect Information
inferred← citeshttps://doi.org/10.65109/qguw5542openalex-snapshot
Local Equilibria in Logic-Based Multi-Player Games
inferred← citeshttps://doi.org/10.65109/vqyq4152openalex-snapshot
Resource-bounded ATL: the Quest for Tractable Fragments
inferred← citeshttps://doi.org/10.65109/zkug1699openalex-snapshot
Nash Equilibria in Finite-Horizon Multiagent Concurrent Games
inferred← citeshttps://doi.org/10.70675/4a9c5939z993ez4410z9831z9f7dfc3b2346openalex-snapshot
Semantics of Strategy Logic
inferred← citeshttps://doi.org/10.70675/b89ce17az4d57z46bbza601z77876f7684f6openalex-snapshot
Strategic reasoning with dependencies : hyperteam logics, realizable strategies, dependency matrices
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.