On the public citation graph
Synthesizing Best-effort Strategies under Multiple Environment Specifications
0 signed · 39 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.1006/inco.1994.1092openalex-snapshot
Reasoning about Infinite Computations
inferredcites →https://doi.org/10.1007/978-3-030-59152-6_25openalex-snapshot
Dependency-Based Compositional Synthesis
inferredcites →https://doi.org/10.1007/978-3-319-06410-9_13openalex-snapshot
Automatic Compositional Synthesis of Distributed Systems
inferredcites →https://doi.org/10.1007/978-3-540-70918-3_17openalex-snapshot
Admissibility in Infinite Games
inferredcites →https://doi.org/10.1007/978-3-642-03816-7_27openalex-snapshot
Admissible Strategies in Infinite Games over Graphs
inferredcites →https://doi.org/10.1007/s00236-016-0273-2openalex-snapshot
Assume-admissible synthesis
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.1017/cbo9780511973468openalex-snapshot
Lectures in Game Theory for Computer Scientists
inferredcites →https://doi.org/10.1023/a:1018985923441openalex-snapshot
Planning for temporally extended goals
inferredcites →https://doi.org/10.1145/2603088.2603143openalex-snapshot
The complexity of admissibility in Omega-regular games
inferredcites →https://doi.org/10.1145/3427955openalex-snapshot
Strategy Logic with Imperfect Information
inferredcites →https://doi.org/10.1145/75277.75293openalex-snapshot
On the synthesis of a reactive module
inferredcites →https://doi.org/10.1609/icaps.v29i1.3460openalex-snapshot
Towards a Unified View of AI Planning and Reactive Synthesis
inferredcites →https://doi.org/10.1609/icaps.v30i1.6646openalex-snapshot
Multi-Tier Automated Planning for Adaptive Behavior
inferredcites →https://doi.org/10.1613/jair.5562openalex-snapshot
Fully Observable Non-deterministic Planning as Assumption-Based Reactive Synthesis
inferredcites →https://doi.org/10.24963/ijcai.2018/657openalex-snapshot
Automata-Theoretic Foundations of FOND Planning for LTLf and LDLf Goals
inferredcites →https://doi.org/10.24963/ijcai.2020/232openalex-snapshot
Synthesizing strategies under expected and exceptional environment behaviors
inferredcites →https://doi.org/10.24963/ijcai.2021/243openalex-snapshot
Best-Effort Synthesis: Doing Your Best Is Not Harder Than Giving Up
inferredcites →https://doi.org/10.3233/aic-2011-0508openalex-snapshot
Foundations and applications of generalized planning
inferredcites →https://doi.org/10.4230/lipics.csl.2026.30openalex-snapshot
Reward Interfaces with Best-Effort Implementations
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.1808.10831openalex-snapshot
Finite LTL Synthesis with Environment Assumptions and Quality Measures
inferredcites →https://doi.org/10.5591/978-1-57735-516-8/ijcai11-159openalex-snapshot
Generalized planning: synthesizing plans that work for multiple environments
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-43264-4_15openalex-snapshot
Symbolic $$\textsc {ltl}_f$$ Best-Effort Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-031-43264-4_17openalex-snapshot
$${\textsc {ltl}}_f$$ Synthesis Under Environment Specifications for Reachability and Safety Properties
inferred← citeshttps://doi.org/10.1007/978-3-031-43264-4_40openalex-snapshot
ltl $$_f$$ Best-Effort Synthesis for Single and Multiple Goal and Planning Domain Specifications
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-40774-0_19openalex-snapshot
Realizability Check for Pure Past Linear Temporal Logic on Finite Traces
inferred← citeshttps://doi.org/10.1007/s10458-022-09570-wopenalex-snapshot
Unavoidable deadends in deterministic partially observable contingent planning
inferred← citeshttps://doi.org/10.1007/s42979-024-03337-8openalex-snapshot
Symbolic ltl$$_f$$ Synthesis: A Unified Approach for Synthesizing Winning, Dominant, and Best-Effort Strategies
inferred← citeshttps://doi.org/10.1016/j.ic.2024.105255openalex-snapshot
ltl synthesis under environment specifications for reachability and safety properties
inferred← citeshttps://doi.org/10.1109/lics56636.2023.10175747openalex-snapshot
Stochastic Best-Effort Strategies for Borel Goals
inferred← citeshttps://doi.org/10.1145/3832783.3837439openalex-snapshot
Best-Effort GR(1) Synthesis: Exploiting Environmental Cooperation under Unrealizability
inferred← citeshttps://doi.org/10.24963/ijcai.2023/347openalex-snapshot
Abstraction of Nondeterministic Situation Calculus Action Theories
inferred← citeshttps://doi.org/10.3233/faia230313openalex-snapshot
LTLf Best-Effort Synthesis in Nondeterministic Planning Domains
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.