[{"citation":{"chicago":"Chatterjee, Krishnendu, Martin Chmelik, and Jessica Davies. A Symbolic SAT-Based Algorithm for Almost-Sure Reachability with Small Strategies in POMDPs. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-325-v2-1.","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. A Symbolic SAT-Based Algorithm for Almost-Sure Reachability with Small Strategies in POMDPs. IST Austria, 2015, doi:10.15479/AT:IST-2015-325-v2-1.","short":"K. Chatterjee, M. Chmelik, J. Davies, A Symbolic SAT-Based Algorithm for Almost-Sure Reachability with Small Strategies in POMDPs, IST Austria, 2015.","ieee":"K. Chatterjee, M. Chmelik, and J. Davies, A symbolic SAT-based algorithm for almost-sure reachability with small strategies in POMDPs. IST Austria, 2015.","ama":"Chatterjee K, Chmelik M, Davies J. A Symbolic SAT-Based Algorithm for Almost-Sure Reachability with Small Strategies in POMDPs. IST Austria; 2015. doi:10.15479/AT:IST-2015-325-v2-1","apa":"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"},"date_updated":"2023-02-21T16:24:05Z","ddc":["000"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Chmelik, Martin","last_name":"Chmelik","first_name":"Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Davies, Jessica","last_name":"Davies","id":"378E0060-F248-11E8-B48F-1D18A9856A87","first_name":"Jessica"}],"file_date_updated":"2020-07-14T12:46:57Z","title":"A symbolic SAT-based algorithm for almost-sure reachability with small strategies in POMDPs","department":[{"_id":"KrCh"}],"_id":"5443","type":"technical_report","status":"public","pubrep_id":"362","has_accepted_license":"1","publication_identifier":{"issn":["2664-1690"]},"publication_status":"published","year":"2015","day":"06","file":[{"date_created":"2018-12-12T11:53:05Z","file_name":"IST-2015-325-v2+1_main.pdf","creator":"system","date_updated":"2020-07-14T12:46:57Z","file_size":412379,"checksum":"f0fa31ad8161ed655137e94012123ef9","file_id":"5466","access_level":"open_access","relation":"main_file","content_type":"application/pdf"}],"language":[{"iso":"eng"}],"page":"23","related_material":{"record":[{"id":"1166","status":"public","relation":"later_version"}]},"date_published":"2015-11-06T00:00:00Z","doi":"10.15479/AT:IST-2015-325-v2-1","date_created":"2018-12-12T11:39:22Z","abstract":[{"lang":"eng","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."}],"oa_version":"Published Version","alternative_title":["IST Austria Technical Report"],"publisher":"IST Austria","oa":1,"month":"11"},{"_id":"5804","status":"public","type":"journal_article","extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Biswas R, Bhowmick P. 2015. From prima quadraginta octant to lattice sphere through primitive integer operations. Theoretical Computer Science. 624(4), 56–72.","chicago":"Biswas, Ranita, and Partha Bhowmick. “From Prima Quadraginta Octant to Lattice Sphere through Primitive Integer Operations.” Theoretical Computer Science. Elsevier, 2015. https://doi.org/10.1016/j.tcs.2015.11.018.","ama":"Biswas R, Bhowmick P. From prima quadraginta octant to lattice sphere through primitive integer operations. Theoretical Computer Science. 2015;624(4):56-72. doi:10.1016/j.tcs.2015.11.018","apa":"Biswas, R., & Bhowmick, P. (2015). From prima quadraginta octant to lattice sphere through primitive integer operations. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2015.11.018","short":"R. Biswas, P. Bhowmick, Theoretical Computer Science 624 (2015) 56–72.","ieee":"R. Biswas and P. Bhowmick, “From prima quadraginta octant to lattice sphere through primitive integer operations,” Theoretical Computer Science, vol. 624, no. 4. Elsevier, pp. 56–72, 2015.","mla":"Biswas, Ranita, and Partha Bhowmick. “From Prima Quadraginta Octant to Lattice Sphere through Primitive Integer Operations.” Theoretical Computer Science, vol. 624, no. 4, Elsevier, 2015, pp. 56–72, doi:10.1016/j.tcs.2015.11.018."},"date_updated":"2021-01-12T08:03:36Z","title":"From prima quadraginta octant to lattice sphere through primitive integer operations","author":[{"last_name":"Biswas","full_name":"Biswas, Ranita","orcid":"0000-0002-5372-7890","id":"3C2B033E-F248-11E8-B48F-1D18A9856A87","first_name":"Ranita"},{"full_name":"Bhowmick, Partha","last_name":"Bhowmick","first_name":"Partha"}],"oa_version":"None","abstract":[{"text":"We present here the first integer-based algorithm for constructing a well-defined lattice sphere specified by integer radius and integer center. The algorithm evolves from a unique correspondence between the lattice points comprising the sphere and the distribution of sum of three square numbers in integer intervals. We characterize these intervals to derive a useful set of recurrences, which, in turn, aids in efficient computation. Each point of the lattice sphere is determined by resorting to only a few primitive operations in the integer domain. The symmetry of its quadraginta octants provides an added advantage by confining the computation to its prima quadraginta octant. Detailed theoretical analysis and experimental results have been furnished to demonstrate its simplicity and elegance.","lang":"eng"}],"month":"04","intvolume":" 624","publisher":"Elsevier","quality_controlled":"1","day":"18","publication":"Theoretical Computer Science","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0304-3975"]},"year":"2015","publication_status":"published","doi":"10.1016/j.tcs.2015.11.018","volume":624,"issue":"4","date_published":"2015-04-18T00:00:00Z","date_created":"2019-01-08T20:44:06Z","page":"56-72"},{"page":"146-163","issue":"11","volume":605,"date_published":"2015-11-09T00:00:00Z","doi":"10.1016/j.tcs.2015.09.003","date_created":"2019-01-08T20:44:52Z","publication_identifier":{"issn":["0304-3975"]},"publication_status":"published","year":"2015","day":"09","publication":"Theoretical Computer Science","language":[{"iso":"eng"}],"quality_controlled":"1","publisher":"Elsevier","month":"11","intvolume":" 605","oa_version":"None","author":[{"orcid":"0000-0002-5372-7890","full_name":"Biswas, Ranita","last_name":"Biswas","first_name":"Ranita","id":"3C2B033E-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Bhowmick","full_name":"Bhowmick, Partha","first_name":"Partha"}],"title":"On different topological classes of spherical geodesic paths and circles inZ3","date_updated":"2021-01-12T08:03:37Z","citation":{"ista":"Biswas R, Bhowmick P. 2015. On different topological classes of spherical geodesic paths and circles inZ3. Theoretical Computer Science. 605(11), 146–163.","chicago":"Biswas, Ranita, and Partha Bhowmick. “On Different Topological Classes of Spherical Geodesic Paths and Circles InZ3.” Theoretical Computer Science. Elsevier, 2015. https://doi.org/10.1016/j.tcs.2015.09.003.","apa":"Biswas, R., & Bhowmick, P. (2015). On different topological classes of spherical geodesic paths and circles inZ3. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2015.09.003","ama":"Biswas R, Bhowmick P. On different topological classes of spherical geodesic paths and circles inZ3. Theoretical Computer Science. 2015;605(11):146-163. doi:10.1016/j.tcs.2015.09.003","ieee":"R. Biswas and P. Bhowmick, “On different topological classes of spherical geodesic paths and circles inZ3,” Theoretical Computer Science, vol. 605, no. 11. Elsevier, pp. 146–163, 2015.","short":"R. Biswas, P. Bhowmick, Theoretical Computer Science 605 (2015) 146–163.","mla":"Biswas, Ranita, and Partha Bhowmick. “On Different Topological Classes of Spherical Geodesic Paths and Circles InZ3.” Theoretical Computer Science, vol. 605, no. 11, Elsevier, 2015, pp. 146–63, doi:10.1016/j.tcs.2015.09.003."},"extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","status":"public","_id":"5807"},{"quality_controlled":"1","publisher":"Springer Nature","intvolume":" 31","month":"05","oa_version":"None","page":"787-797","date_created":"2019-01-08T20:45:05Z","doi":"10.1007/s00371-015-1101-3","volume":31,"issue":"6-8","date_published":"2015-05-08T00:00:00Z","publication_status":"published","year":"2015","publication_identifier":{"issn":["0178-2789","1432-2315"]},"language":[{"iso":"eng"}],"publication":"The Visual Computer","day":"08","type":"journal_article","status":"public","_id":"5808","author":[{"full_name":"Biswas, Ranita","orcid":"0000-0002-5372-7890","last_name":"Biswas","id":"3C2B033E-F248-11E8-B48F-1D18A9856A87","first_name":"Ranita"},{"last_name":"Bhowmick","full_name":"Bhowmick, Partha","first_name":"Partha"}],"title":"Layer the sphere","date_updated":"2021-01-12T08:03:37Z","citation":{"mla":"Biswas, Ranita, and Partha Bhowmick. “Layer the Sphere.” The Visual Computer, vol. 31, no. 6–8, Springer Nature, 2015, pp. 787–97, doi:10.1007/s00371-015-1101-3.","apa":"Biswas, R., & Bhowmick, P. (2015). Layer the sphere. The Visual Computer. Springer Nature. https://doi.org/10.1007/s00371-015-1101-3","ama":"Biswas R, Bhowmick P. Layer the sphere. The Visual Computer. 2015;31(6-8):787-797. doi:10.1007/s00371-015-1101-3","ieee":"R. Biswas and P. Bhowmick, “Layer the sphere,” The Visual Computer, vol. 31, no. 6–8. Springer Nature, pp. 787–797, 2015.","short":"R. Biswas, P. Bhowmick, The Visual Computer 31 (2015) 787–797.","chicago":"Biswas, Ranita, and Partha Bhowmick. “Layer the Sphere.” The Visual Computer. Springer Nature, 2015. https://doi.org/10.1007/s00371-015-1101-3.","ista":"Biswas R, Bhowmick P. 2015. Layer the sphere. The Visual Computer. 31(6–8), 787–797."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1"},{"publisher":"Nature Publishing Group","intvolume":" 16","month":"03","abstract":[{"text":"Transcription of eukaryotic protein-coding genes commences with the assembly of a conserved initiation complex, which consists of RNA polymerase II (Pol II) and the general transcription factors, at promoter DNA. After two decades of research, the structural basis of transcription initiation is emerging. Crystal structures of many components of the initiation complex have been resolved, and structural information on Pol II complexes with general transcription factors has recently been obtained. Although mechanistic details await elucidation, available data outline how Pol II cooperates with the general transcription factors to bind to and open promoter DNA, and how Pol II directs RNA synthesis and escapes from the promoter.","lang":"eng"}],"oa_version":"None","page":"129 - 143","date_created":"2018-12-11T11:47:23Z","volume":16,"issue":"3","date_published":"2015-03-26T00:00:00Z","doi":"10.1038/nrm3952","year":"2015","publication_status":"published","publication":"Nature Reviews Molecular Cell Biology","language":[{"iso":"eng"}],"day":"26","type":"journal_article","status":"public","_id":"594","article_processing_charge":"No","publist_id":"7206","author":[{"full_name":"Sainsbury, Sarah","last_name":"Sainsbury","first_name":"Sarah"},{"id":"2CB9DFE2-F248-11E8-B48F-1D18A9856A87","first_name":"Carrie A","full_name":"Bernecky, Carrie A","orcid":"0000-0003-0893-7036","last_name":"Bernecky"},{"first_name":"Patrick","full_name":"Cramer, Patrick","last_name":"Cramer"}],"title":"Structural basis of transcription initiation by RNA polymerase II","date_updated":"2021-01-12T08:05:16Z","citation":{"mla":"Sainsbury, Sarah, et al. “Structural Basis of Transcription Initiation by RNA Polymerase II.” Nature Reviews Molecular Cell Biology, vol. 16, no. 3, Nature Publishing Group, 2015, pp. 129–43, doi:10.1038/nrm3952.","apa":"Sainsbury, S., Bernecky, C., & Cramer, P. (2015). Structural basis of transcription initiation by RNA polymerase II. Nature Reviews Molecular Cell Biology. Nature Publishing Group. https://doi.org/10.1038/nrm3952","ama":"Sainsbury S, Bernecky C, Cramer P. Structural basis of transcription initiation by RNA polymerase II. Nature Reviews Molecular Cell Biology. 2015;16(3):129-143. doi:10.1038/nrm3952","ieee":"S. Sainsbury, C. Bernecky, and P. Cramer, “Structural basis of transcription initiation by RNA polymerase II,” Nature Reviews Molecular Cell Biology, vol. 16, no. 3. Nature Publishing Group, pp. 129–143, 2015.","short":"S. Sainsbury, C. Bernecky, P. Cramer, Nature Reviews Molecular Cell Biology 16 (2015) 129–143.","chicago":"Sainsbury, Sarah, Carrie Bernecky, and Patrick Cramer. “Structural Basis of Transcription Initiation by RNA Polymerase II.” Nature Reviews Molecular Cell Biology. Nature Publishing Group, 2015. https://doi.org/10.1038/nrm3952.","ista":"Sainsbury S, Bernecky C, Cramer P. 2015. Structural basis of transcription initiation by RNA polymerase II. Nature Reviews Molecular Cell Biology. 16(3), 129–143."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1"}]