1. Baral, C., Kreinovich, V., Trejo, R.: Computational complexity of planning and approximate planning in the presence of incompleteness. Artif. Intell. 122(1), 241–267 (2000)
2. Biere, A., Fazekas, K., Fleury, M., Heisinger, M.: CaDiCaL, kissat, paracooba, plingeling and treengeling entering the SAT competition 2020. In: Proceedings of SAT Competition 2020 - Solver and Benchmark Descriptions, pp. 51–53. Department of Computer Science Report Series B, vol. B-2020-1, University of Helsinki (2020)
3. Bonet, B., Geffner, H.: Planning under partial observability by classical replanning: theory and experiments. In: Proceedings of the 22nd International Joint Conference on Artificial Intelligence, pp. 1936–1941 (2011)
4. Bonet, B., Geffner, H.: Flexible and scalable partially observable planning with linear translations. In: Proceedings of the 28th AAAI Conference on Artificial Intelligence (AAAI-14), pp. 2235–2241. Citeseer (2014)
5. Chatterjee, K., Chmelik, M., Davies, J.: A symbolic SAT-based algorithm for almost-sure reachability with small strategies in POMDPs. In: Proceedings of the 30th AAAI Conference on Artificial Intelligence (AAAI-16), pp. 3225–3232. AAAI Press (2016)