当前位置: X-MOL 学术Theory Pract. Log. Program. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Elaboration Tolerant Representation of Markov Decision Process via Decision-Theoretic Extension of Probabilistic Action Language +
Theory and Practice of Logic Programming ( IF 1.4 ) Pub Date : 2020-12-23 , DOI: 10.1017/s1471068420000472
YI WANG , JOOHYUNG LEE

We extend probabilistic action language $p{\cal BC}$+ with the notion of utility in decision theory. The semantics of the extended $p{\cal BC}$+ can be defined as a shorthand notation for a decision-theoretic extension of the probabilistic answer set programming language LPMLN. Alternatively, the semantics of $p{\cal BC}$+ 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}$+ action description. The idea led to the design of the system pbcplus2mdp, which can find an optimal policy of a $p{\cal BC}$+ action description using an MDP solver.

中文翻译:

通过概率动作语言的决策理论扩展实现马尔可夫决策过程的精细化容忍表示 +

我们扩展了概率动作语言$p{\cal BC}$+ 与决策理论中的效用概念。扩展的语义$p{\cal BC}$+ 可以定义为概率答案集编程语言 LP 的决策理论扩展的简写符号MLN. 或者,语义$p{\cal BC}$+ 也可以用马尔可夫决策过程 (MDP) 来定义,这反过来又允许以简洁和精细的方式表示 MDP,并利用 MDP 求解器来计算$p{\cal BC}$+ 动作描述。这个想法导致了系统的设计pbcplus2mdp,它可以找到一个最优策略$p{\cal BC}$+ 使用 MDP 求解器的动作描述。
更新日期:2020-12-23
down
wechat
bug