ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1511.08456
  4. Cited By
A Symbolic SAT-based Algorithm for Almost-sure Reachability with Small
  Strategies in POMDPs

A Symbolic SAT-based Algorithm for Almost-sure Reachability with Small Strategies in POMDPs

26 November 2015
K. Chatterjee
Martin Chmelík
Jessica Davies
ArXiv (abs)PDFHTML

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 Systems
Natural Strategic Ability in Stochastic Multi-Agent SystemsAAAI Conference on Artificial Intelligence (AAAI), 2024
Raphaël Berthon
J. Katoen
Munyque Mittelmann
A. Murano
55
2
0
22 Jan 2024
Safe Reinforcement Learning via Shielding under Partial Observability
Safe Reinforcement Learning via Shielding under Partial ObservabilityAAAI Conference on Artificial Intelligence (AAAI), 2022
Steven Carr
N. Jansen
Sebastian Junges
Ufuk Topcu
127
59
0
02 Apr 2022
Under-Approximating Expected Total Rewards in POMDPs
Under-Approximating Expected Total Rewards in POMDPsInternational Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS), 2022
Alexander Bork
J. Katoen
Tim Quatmann
111
10
0
21 Jan 2022
Propositional Encodings of Acyclicity and Reachability by using Vertex
  Elimination
Propositional Encodings of Acyclicity and Reachability by using Vertex EliminationAAAI Conference on Artificial Intelligence (AAAI), 2021
Masood Feyzbakhsh Rankooh
J. Rintanen
74
12
0
27 May 2021
Flexible FOND Planning with Explicit Fairness Assumptions
Flexible FOND Planning with Explicit Fairness AssumptionsInternational Conference on Automated Planning and Scheduling (ICAPS), 2021
I. D. Rodriguez
Blai Bonet
Sebastian Sardiña
Hector Geffner
81
12
0
15 Mar 2021
Enforcing Almost-Sure Reachability in POMDPs
Enforcing Almost-Sure Reachability in POMDPs
Sebastian Junges
N. Jansen
Sanjit A. Seshia
196
29
0
30 Jun 2020
A Correctness Result for Synthesizing Plans With Loops in Stochastic
  Domains
A Correctness Result for Synthesizing Plans With Loops in Stochastic DomainsInternational Journal of Approximate Reasoning (IJAR), 2019
Laszlo Treszkai
Vaishak Belle
62
6
0
16 May 2019
Counterexample-Driven Synthesis for Probabilistic Program Sketches
Counterexample-Driven Synthesis for Probabilistic Program SketchesWorld Congress on Formal Methods (FM), 2019
Milan Ceska
Christian Hensel
Sebastian Junges
J. Katoen
68
25
0
28 Apr 2019
Shepherding Hordes of Markov Chains
Shepherding Hordes of Markov Chains
Milan Ceska
N. Jansen
Sebastian Junges
J. Katoen
142
30
0
15 Feb 2019
Compact Policies for Fully-Observable Non-Deterministic Planning as SAT
Compact Policies for Fully-Observable Non-Deterministic Planning as SAT
Tomas Geffner
Hector Geffner
OffRLLRM
69
32
0
25 Jun 2018
Model-free, Model-based, and General Intelligence
Model-free, Model-based, and General Intelligence
Hector Geffner
LRMELM
89
59
0
06 Jun 2018
Bounded Policy Synthesis for POMDPs with Safe-Reachability Objectives
Bounded Policy Synthesis for POMDPs with Safe-Reachability Objectives
Yue Wang
Swarat Chaudhuri
Lydia E. Kavraki
115
30
0
29 Jan 2018
Sensor Synthesis for POMDPs with Reachability Objectives
Sensor Synthesis for POMDPs with Reachability Objectives
K. Chatterjee
Martin Chmelík
Ufuk Topcu
141
3
0
29 Sep 2017
Supervisor Synthesis of POMDP based on Automata Learning
Supervisor Synthesis of POMDP based on Automata Learning
Xiaobin Zhang
B. Wu
Hai Lin
76
4
0
24 Mar 2017
1