{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T22:00:56Z","timestamp":1747173656791,"version":"3.40.5"},"reference-count":36,"publisher":"Cambridge University Press (CUP)","issue":"3","license":[{"start":{"date-parts":[[2020,12,23]],"date-time":"2020-12-23T00:00:00Z","timestamp":1608681600000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":["cambridge.org"],"crossmark-restriction":true},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2021,5]]},"abstract":"Abstract<\/jats:title>We extend probabilistic action language $p{\\cal BC}$<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>+ with the notion of utility in decision theory. The semantics of the extended $p{\\cal BC}$<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>+ can be defined as a shorthand notation for a decision-theoretic extension of the probabilistic answer set programming language LPMLN<\/jats:sup>. Alternatively, the semantics of $p{\\cal BC}$<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>+ can also be defined in terms of Markov decision process (MDP), which in turn allows for representing MDP in a succinct and elaboration tolerant way as well as leveraging an MDP solver to compute a $p{\\cal BC}$<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>+ action description. The idea led to the design of the system pbcplus2mdp<\/jats:sc>, which can find an optimal policy of a $p{\\cal BC}$<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>+ action description using an MDP solver.<\/jats:p>","DOI":"10.1017\/s1471068420000472","type":"journal-article","created":{"date-parts":[[2020,12,23]],"date-time":"2020-12-23T09:25:34Z","timestamp":1608715534000},"page":"348-371","update-policy":"https:\/\/doi.org\/10.1017\/policypage","source":"Crossref","is-referenced-by-count":0,"title":["Elaboration Tolerant Representation of Markov Decision Process via Decision-Theoretic Extension of Probabilistic Action Language +"],"prefix":"10.1017","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5394-5548","authenticated-orcid":false,"given":"YI","family":"WANG","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9569-5575","authenticated-orcid":false,"given":"JOOHYUNG","family":"LEE","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2020,12,23]]},"reference":[{"key":"S1471068420000472_ref35","unstructured":"Younes, H. L. and Littman, M. L. 2004. PPDDL1.0: An extension to PDDL for expressing planning domains with probabilistic effects. Techn. Rep. CMU-CS-04-162."},{"key":"S1471068420000472_ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-017-0988-y"},{"key":"S1471068420000472_ref30","unstructured":"Wang, Y. 2020. ywang485\/pbcplus2mdp: pbcplus2mdp v0.1."},{"key":"S1471068420000472_ref32","unstructured":"Watkins, C. J. C. H. 1989. Learning from Delayed Rewards. Ph.D. thesis, King\u2019s College, Cambridge, UK."},{"year":"1963","author":"McCarthy","key":"S1471068420000472_ref20"},{"key":"S1471068420000472_ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78652-8_8"},{"key":"S1471068420000472_ref3","doi-asserted-by":"publisher","DOI":"10.1512\/iumj.1957.6.56038"},{"key":"S1471068420000472_ref34","unstructured":"Yoon, S. , Fern, A. and Givan, R. 2002. Inductive policy selection for first-order MDPs. In Proceedings of the Eighteenth Conference on Uncertainty in Artificial Intelligence. UAI02. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 568\u2013576."},{"key":"S1471068420000472_ref10","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(93)90035-F"},{"key":"S1471068420000472_ref4","unstructured":"Boutilier, C. , Reiter, R. and Price, B. 2001. Symbolic dynamic programming for first-order MDPs. In Proceedings of the 17th International Joint Conference on Artificial Intelligence - Volume 1. IJCAI01, 690\u2013697."},{"key":"S1471068420000472_ref2","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068408003645"},{"key":"S1471068420000472_ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2008.11.003"},{"key":"S1471068420000472_ref29","doi-asserted-by":"publisher","DOI":"10.1613\/jair.2489"},{"key":"S1471068420000472_ref17","unstructured":"Lee, J. and Wang, Y. 2016. Weighted rules under the stable model semantics. In Proceedings of International Conference on Principles of Knowledge Representation and Reasoning (KR), 145\u2013154."},{"key":"S1471068420000472_ref8","doi-asserted-by":"crossref","unstructured":"Ferraris, P. 2005. Answer sets for propositional theories. In Proceedings of International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR), 119\u2013131.","DOI":"10.1007\/11546207_10"},{"key":"S1471068420000472_ref33","first-page":"4860","article-title":"PEORL: Integrating symbolic planning and hierarchical reinforcement learning for robust decision-making","author":"Yang","year":"2018","journal-title":"IJCAI"},{"key":"S1471068420000472_ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-1567-8_21"},{"key":"S1471068420000472_ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30227-8_19"},{"key":"S1471068420000472_ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2002.12.001"},{"key":"S1471068420000472_ref11","first-page":"195","article-title":"Action languages","volume":"3","author":"Gelfond","year":"1998","journal-title":"Electronic Transactions on Artificial Intelligence"},{"key":"S1471068420000472_ref36","unstructured":"Zhang, S. and Stone, P. 2015. CORPP: Commonsense reasoning and probabilistic planning, as applied to dialog with a mobile robot. In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence. AAAI\u201915. AAAI Press, 1394\u20131400."},{"key":"S1471068420000472_ref18","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068418000303"},{"key":"S1471068420000472_ref28","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1.11524"},{"key":"S1471068420000472_ref15","unstructured":"Lee, J. , Lifschitz, V. and Yang, F. 2013. Action language ${\\cal BC}$ : Preliminary report. In Proceedings of International Joint Conference on Artificial Intelligence (IJCAI)."},{"key":"S1471068420000472_ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2016.07.004"},{"key":"S1471068420000472_ref27","doi-asserted-by":"publisher","DOI":"10.1613\/jair.2171"},{"key":"S1471068420000472_ref13","article-title":"A general stochastic approach to solving problems with hard and soft constraints","author":"Kautz","year":"1998","journal-title":"The Satisfiability Problem: Theory and Applications"},{"key":"S1471068420000472_ref6","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v37i3.2678"},{"key":"S1471068420000472_ref1","unstructured":"Babb, J. and Lee, J. 2015. Action language ${\\cal BC}$ +. Journal of Logic and Computation, exv062."},{"key":"S1471068420000472_ref5","unstructured":"Broeck, G. V. d., Thon, I., Otterlo, M. v. and Raedt, L. D. 2010. DTProblog: A decision-theoretic probabilistic prolog. In Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence. AAAI\u201910. AAAI Press, 1217\u20131222."},{"key":"S1471068420000472_ref22","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068406002973"},{"key":"S1471068420000472_ref24","unstructured":"Poole, D. 2013. A framework for decision-theoretic planning I: Combining the situation calculus, conditional plans, probability and utility. arXiv preprint arXiv:1302.3597."},{"key":"S1471068420000472_ref14","doi-asserted-by":"crossref","unstructured":"Lee, J. and Lifschitz, V. 2003. Loop formulas for disjunctive logic programs. In Proceedings of International Conference on Logic Programming (ICLP), 451\u2013465.","DOI":"10.1007\/978-3-540-24599-5_31"},{"key":"S1471068420000472_ref25","unstructured":"Sanner, S. 2010. Relational dynamic influence diagram language (RDDL): Language description. Unpublished ms. Australian National University, 32."},{"key":"S1471068420000472_ref16","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068417000400"},{"year":"2019","author":"Wang","key":"S1471068420000472_ref31"}],"container-title":["Theory and Practice of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1471068420000472","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,21]],"date-time":"2021-05-21T11:19:26Z","timestamp":1621595966000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068420000472\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12,23]]},"references-count":36,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,5]]}},"alternative-id":["S1471068420000472"],"URL":"https:\/\/doi.org\/10.1017\/s1471068420000472","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"type":"print","value":"1471-0684"},{"type":"electronic","value":"1475-3081"}],"subject":[],"published":{"date-parts":[[2020,12,23]]},"assertion":[{"value":"\u00a9 The Author(s), 2020. Published by Cambridge University Press","name":"copyright","label":"Copyright","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}}]}}