[{"page":"3225 - 3232","external_id":{"arxiv":["1511.08456"]},"year":"2016","quality_controlled":"1","date_published":"2016-12-02T00:00:00Z","doi":"10.1609/aaai.v30i1.10422","language":[{"iso":"eng"}],"publisher":"AAAI Press","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","OA_place":"repository","volume":2016,"corr_author":"1","type":"conference","citation":{"ieee":"K. Chatterjee, M. Chmelik, and J. Davies, “A symbolic SAT based algorithm for almost sure reachability with small strategies in POMDPs,” in <i>Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence</i>, Phoenix, AZ, United States, 2016, vol. 2016, pp. 3225–3232.","apa":"Chatterjee, K., Chmelik, M., &#38; Davies, J. (2016). A symbolic SAT based algorithm for almost sure reachability with small strategies in POMDPs. In <i>Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence</i> (Vol. 2016, pp. 3225–3232). Phoenix, AZ, United States: AAAI Press. <a href=\"https://doi.org/10.1609/aaai.v30i1.10422\">https://doi.org/10.1609/aaai.v30i1.10422</a>","ama":"Chatterjee K, Chmelik M, Davies J. A symbolic SAT based algorithm for almost sure reachability with small strategies in POMDPs. In: <i>Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence</i>. Vol 2016. AAAI Press; 2016:3225-3232. doi:<a href=\"https://doi.org/10.1609/aaai.v30i1.10422\">10.1609/aaai.v30i1.10422</a>","chicago":"Chatterjee, Krishnendu, Martin Chmelik, and Jessica Davies. “A Symbolic SAT Based Algorithm for Almost Sure Reachability with Small Strategies in POMDPs.” In <i>Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence</i>, 2016:3225–32. AAAI Press, 2016. <a href=\"https://doi.org/10.1609/aaai.v30i1.10422\">https://doi.org/10.1609/aaai.v30i1.10422</a>.","mla":"Chatterjee, Krishnendu, et al. “A Symbolic SAT Based Algorithm for Almost Sure Reachability with Small Strategies in POMDPs.” <i>Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence</i>, vol. 2016, AAAI Press, 2016, pp. 3225–32, doi:<a href=\"https://doi.org/10.1609/aaai.v30i1.10422\">10.1609/aaai.v30i1.10422</a>.","ista":"Chatterjee K, Chmelik M, Davies J. 2016. A symbolic SAT based algorithm for almost sure reachability with small strategies in POMDPs. Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence vol. 2016, 3225–3232.","short":"K. Chatterjee, M. Chmelik, J. Davies, in:, Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, AAAI Press, 2016, pp. 3225–3232."},"publication_status":"published","month":"12","publist_id":"6191","arxiv":1,"_id":"1166","conference":{"end_date":"2016-02-17","name":"AAAI: Conference on Artificial Intelligence","start_date":"2016-02-12","location":"Phoenix, AZ, United States"},"ec_funded":1,"publication":"Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence","related_material":{"record":[{"id":"5443","relation":"earlier_version","status":"public"}],"link":[{"url":"https://dl.acm.org/citation.cfm?id=3016355","relation":"table_of_contents"}]},"acknowledgement":"The research was partly supported by Austrian Science Fund (FWF) Grant No P23499-N23, FWF NFN Grant No S11407-N23 (RiSE), ERC Start grant (279307: Graph Games), and Microsoft faculty fellows award.","status":"public","date_created":"2018-12-11T11:50:30Z","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.1511.08456"}],"article_processing_charge":"No","author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"last_name":"Chmelik","full_name":"Chmelik, Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87","first_name":"Martin"},{"last_name":"Davies","full_name":"Davies, Jessica","id":"378E0060-F248-11E8-B48F-1D18A9856A87","first_name":"Jessica"}],"abstract":[{"text":"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 given a set of target states, the question is to decide whether there is a policy to ensure that the target set is reached with probability 1 (almost-surely). While in general the problem is EXPTIMEcomplete, in many practical cases policies with a small amount of memory suffice. Moreover, the existing solution to the problem is explicit, which first requires to construct explicitly an exponential reduction to a belief-support MDP. In this work, we first study the existence of observation-stationary strategies, which is NP-complete, and then small-memory strategies. We present a symbolic algorithm by an efficient encoding to SAT and using a SAT solver for the problem. We report experimental results demonstrating the scalability of our symbolic (SAT-based) approach. © 2016, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.","lang":"eng"}],"intvolume":"      2016","date_updated":"2025-06-25T11:52:14Z","oa_version":"Preprint","day":"02","title":"A symbolic SAT based algorithm for almost sure reachability with small strategies in POMDPs","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"279307"}],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"OA_type":"green"},{"title":"A symbolic SAT-based algorithm for almost-sure reachability with small strategies in POMDPs","alternative_title":["IST Austria Technical Report"],"day":"06","month":"11","ddc":["000"],"_id":"5443","has_accepted_license":"1","department":[{"_id":"KrCh"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"},{"last_name":"Chmelik","full_name":"Chmelik, Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87","first_name":"Martin"},{"id":"378E0060-F248-11E8-B48F-1D18A9856A87","first_name":"Jessica","last_name":"Davies","full_name":"Davies, Jessica"}],"citation":{"short":"K. Chatterjee, M. Chmelik, J. Davies, A Symbolic SAT-Based Algorithm for Almost-Sure Reachability with Small Strategies in POMDPs, IST Austria, 2015.","chicago":"Chatterjee, Krishnendu, Martin Chmelik, and Jessica Davies. <i>A Symbolic SAT-Based Algorithm for Almost-Sure Reachability with Small Strategies in POMDPs</i>. IST Austria, 2015. <a href=\"https://doi.org/10.15479/AT:IST-2015-325-v2-1\">https://doi.org/10.15479/AT:IST-2015-325-v2-1</a>.","ista":"Chatterjee K, Chmelik M, Davies J. 2015. A symbolic SAT-based algorithm for almost-sure reachability with small strategies in POMDPs, IST Austria, 23p.","mla":"Chatterjee, Krishnendu, et al. <i>A Symbolic SAT-Based Algorithm for Almost-Sure Reachability with Small Strategies in POMDPs</i>. IST Austria, 2015, doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-325-v2-1\">10.15479/AT:IST-2015-325-v2-1</a>.","apa":"Chatterjee, K., Chmelik, M., &#38; Davies, J. (2015). <i>A symbolic SAT-based algorithm for almost-sure reachability with small strategies in POMDPs</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2015-325-v2-1\">https://doi.org/10.15479/AT:IST-2015-325-v2-1</a>","ama":"Chatterjee K, Chmelik M, Davies J. <i>A Symbolic SAT-Based Algorithm for Almost-Sure Reachability with Small Strategies in POMDPs</i>. IST Austria; 2015. doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-325-v2-1\">10.15479/AT:IST-2015-325-v2-1</a>","ieee":"K. Chatterjee, M. Chmelik, and J. Davies, <i>A symbolic SAT-based algorithm for almost-sure reachability with small strategies in POMDPs</i>. IST Austria, 2015."},"date_updated":"2025-06-25T11:52:13Z","publication_status":"published","oa_version":"Published Version","abstract":[{"text":"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 given a set of target states, the question is to decide whether there is a policy to ensure that the target set is reached with probability 1 (almost-surely). While in general the problem is EXPTIME-complete, in many practical cases policies with a small amount of memory suffice. Moreover, the existing solution to the problem is explicit, which first requires to construct explicitly an exponential reduction to a belief-support MDP. In this work, we first study the existence of observation-stationary strategies, which is NP-complete, and then small-memory strategies. We present a symbolic algorithm by an efficient encoding to SAT and using a SAT solver for the problem. We report experimental results demonstrating the scalability of our symbolic (SAT-based) approach.","lang":"eng"}],"type":"technical_report","file_date_updated":"2020-07-14T12:46:57Z","status":"public","oa":1,"date_created":"2018-12-12T11:39:22Z","file":[{"creator":"system","relation":"main_file","date_created":"2018-12-12T11:53:05Z","file_size":412379,"date_updated":"2020-07-14T12:46:57Z","content_type":"application/pdf","access_level":"open_access","checksum":"f0fa31ad8161ed655137e94012123ef9","file_name":"IST-2015-325-v2+1_main.pdf","file_id":"5466"}],"publisher":"IST Austria","doi":"10.15479/AT:IST-2015-325-v2-1","language":[{"iso":"eng"}],"date_published":"2015-11-06T00:00:00Z","publication_identifier":{"issn":["2664-1690"]},"pubrep_id":"362","page":"23","year":"2015","related_material":{"record":[{"status":"public","id":"1166","relation":"later_version"}]}}]