Limit-sure Reachability for Small Memory Policies in POMDPs is NP-complete

Ali Asadi, Krishnendu Chatterjee, Raimundo Saona, Ali Shafiee. Limit-sure Reachability for Small Memory Policies in POMDPs is NP-complete. In Silvia Chiappa, Sara Magliacane, editors, Conference on Uncertainty in Artificial Intelligence, Rio Othon Palace, Rio de Janeiro, Brazil, 21-25 July 2025. Volume 286 of Proceedings of Machine Learning Research, pages 238-256, PMLR, 2025. [doi]

Authors

Ali Asadi

This author has not been identified. Look up 'Ali Asadi' in Google

Krishnendu Chatterjee

This author has not been identified. Look up 'Krishnendu Chatterjee' in Google

Raimundo Saona

This author has not been identified. Look up 'Raimundo Saona' in Google

Ali Shafiee

This author has not been identified. Look up 'Ali Shafiee' in Google