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]

Abstract

Abstract is missing.