On the public citation graph
Reasoning About Substructures and Games
0 signed · 59 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/j.1538-7305.1961.tb03975.xopenalex-snapshot
Proving Theorems by Pattern Recognition - II
inferredcites →https://doi.org/10.1007/3-540-12896-4_363openalex-snapshot
Deciding branching time logic: A triple exponential decision procedure for CTL
inferredcites →https://doi.org/10.1007/3-540-16078-7_62openalex-snapshot
Temporal reasoning under generalized fairness constraints
inferredcites →https://doi.org/10.1007/3-540-18088-5_22openalex-snapshot
Computation tree logic CTL* and path quantifiers in the monadic theory of the binary tree
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-4612-0171-7openalex-snapshot
Automata Theory and its Applications
inferredcites →https://doi.org/10.1007/978-3-031-91361-7_1openalex-snapshot
An Essay on Sabotage and Obstruction
inferredcites →https://doi.org/10.1007/978-3-031-91361-7_2openalex-snapshot
Model Checking and Satisfiability for Sabotage Modal Logic
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-09764-0_10openalex-snapshot
A Behavioral Hierarchy of Strategy Logic
inferredcites →https://doi.org/10.1007/978-3-642-02737-6_32openalex-snapshot
Branching-Time Temporal Logics with Minimal Model Quantifiers
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/bfb0025774openalex-snapshot
Design and synthesis of synchronization skeletons using branching time temporal logic
inferredcites →https://doi.org/10.1007/s11229-007-9168-7openalex-snapshot
Logics of public communications
inferredcites →https://doi.org/10.1016/0022-0000(81)90039-8openalex-snapshot
Number of quantifiers is better than number of tape cells
inferredcites →https://doi.org/10.1016/0022-0000(85)90001-7openalex-snapshot
Decision procedures and expressiveness in the temporal logic of branching time
inferredcites →https://doi.org/10.1016/0304-3975(81)90110-9openalex-snapshot
The temporal semantics of concurrent programs
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/0315-0860(75)90051-8openalex-snapshot
International Congress of Mathematicians 1974
inferredcites →https://doi.org/10.1016/j.apal.2016.10.009openalex-snapshot
Reasoning about equilibria in game-like concurrent systems
inferredcites →https://doi.org/10.1016/s0165-1765(00)00371-2openalex-snapshot
Local equilibria in economic games
inferredcites →https://doi.org/10.1016/s0890-5401(03)00104-4openalex-snapshot
Counting on CTL*: on the expressive power of monadic path logic
inferredcites →https://doi.org/10.1016/s1571-0661(05)82604-0openalex-snapshot
Alternating-time logic with imperfect recall
inferredcites →https://doi.org/10.1023/a:1008222603071openalex-snapshot
Reasoning about Information Change
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.1109/lics.2013.32openalex-snapshot
On the Boundary of Behavioral Strategies
inferredcites →https://doi.org/10.1145/1516507.1516510openalex-snapshot
On the origins of bisimulation and coinduction
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/5397.5399openalex-snapshot
Automatic verification of finite-state concurrent systems using temporal logic specifications
inferredcites →https://doi.org/10.1145/567446.567463openalex-snapshot
"Sometime" is sometimes "not never"
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.1145/800125.804029openalex-snapshot
Word problems requiring exponential time(Preliminary Report)
inferredcites →https://doi.org/10.1145/970831.970837openalex-snapshot
Review of "Automata theory and its applications" by Bakhadyr Khoussainov and Anil Nerode. Birkhäuser Boston, Inc. 2001.
inferredcites →https://doi.org/10.2168/lmcs-4(3:11)2008openalex-snapshot
The Complexity of Enriched Mu-Calculi
inferredcites →https://doi.org/10.2991/978-94-91216-95-4_3openalex-snapshot
Reasoning About Strategies
inferredcites →https://doi.org/10.4204/eptcs.119.17openalex-snapshot
Alternating-time temporal logic with finite-memory strategies
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-032-08064-6_4openalex-snapshot
A Logic for Resource-Sensitive Coalition Games
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/s10703-018-0315-1openalex-snapshot
Solving parity games via priority promotion
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.09.005openalex-snapshot
A delayed promotion policy for parity games
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.2023.105081openalex-snapshot
Taming Strategy Logic: Non-Recurrent Fragments
inferred← citeshttps://doi.org/10.1109/lics56636.2023.10175832openalex-snapshot
Quantifying Over Trees in Monadic Second-Order Logic
inferred← citeshttps://doi.org/10.1145/3565365openalex-snapshot
Good-for-Game QPTL: An Alternating Hodges Semantics
inferred← citeshttps://doi.org/10.1609/aaai.v33i01.33012638openalex-snapshot
Satisfiability in Strategy Logic Can Be Easier than Model 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.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.