2 Publications

Mark all

[2]
2016 | Conference Paper | IST-REx-ID: 1166
Chatterjee, K., Chmelik, M., & Davies, J. (2016). A symbolic SAT based algorithm for almost sure reachability with small strategies in pomdps. In Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence (Vol. 2016, pp. 3225–3232). Phoenix, AZ, USA: AAAI Press.
View | Files available
 
[1]
2015 | Technical Report | IST-REx-ID: 5443 | OA
Chatterjee, K., Chmelik, M., & Davies, J. (2015). A symbolic SAT-based algorithm for almost-sure reachability with small strategies in POMDPs. IST Austria. https://doi.org/10.15479/AT:IST-2015-325-v2-1
[Published Version] View | Files available | DOI
 

Search

Filter Publications

2 Publications

Mark all

[2]
2016 | Conference Paper | IST-REx-ID: 1166
Chatterjee, K., Chmelik, M., & Davies, J. (2016). A symbolic SAT based algorithm for almost sure reachability with small strategies in pomdps. In Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence (Vol. 2016, pp. 3225–3232). Phoenix, AZ, USA: AAAI Press.
View | Files available
 
[1]
2015 | Technical Report | IST-REx-ID: 5443 | OA
Chatterjee, K., Chmelik, M., & Davies, J. (2015). A symbolic SAT-based algorithm for almost-sure reachability with small strategies in POMDPs. IST Austria. https://doi.org/10.15479/AT:IST-2015-325-v2-1
[Published Version] View | Files available | DOI
 

Search

Filter Publications