3 citations · 9 across the 10 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.AI2015
A Symbolic SAT-based Algorithm for Almost-sure Reachability with Small Strategies in POMDPs
Krishnendu Chatterjee, Martin Chmelik, Jessica Davies
POMDPs are standard models for probabilistic planning problems, where an agent interacts with an uncertain environment. We study the problem of almost-sure reachability, where give…
cs.LO2015★ 2 cited
Counterexample Explanation by Learning Small Strategies in Markov Decision Processes
Tomáš Brázdil, Krishnendu Chatterjee, Martin Chmelík +2
While for deterministic systems, a counterexample to a property can simply be an error trace, counterexamples in probabilistic systems are necessarily more complex. For instance, a…