A Symbolic SAT-based Algorithm for Almost-sure Reachability with Small
Strategies in POMDPs
Papers citing "A Symbolic SAT-based Algorithm for Almost-sure Reachability with Small Strategies in POMDPs"
14 / 14 papers shown
Title |
|---|
 Natural Strategic Ability in Stochastic Multi-Agent SystemsAAAI Conference on Artificial Intelligence (AAAI), 2024 |
 Safe Reinforcement Learning via Shielding under Partial ObservabilityAAAI Conference on Artificial Intelligence (AAAI), 2022 |
 Under-Approximating Expected Total Rewards in POMDPsInternational Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS), 2022 |
 Propositional Encodings of Acyclicity and Reachability by using Vertex
EliminationAAAI Conference on Artificial Intelligence (AAAI), 2021 |
 Flexible FOND Planning with Explicit Fairness AssumptionsInternational Conference on Automated Planning and Scheduling (ICAPS), 2021 |
 A Correctness Result for Synthesizing Plans With Loops in Stochastic
DomainsInternational Journal of Approximate Reasoning (IJAR), 2019 |
 Counterexample-Driven Synthesis for Probabilistic Program SketchesWorld Congress on Formal Methods (FM), 2019 |
