Epistemic Specifications with Probabilities
Shutao Zhang, Zhizheng Zhang · 2017
This paper develops a probabilistic-epistemic logic program language, PELP, by introducing probabilistic modal operators Kwand PL into LPMLNprograms, where w is a sub-interval of [0, 1]. Intuitively, a probabilistic epistemic literal Kwe denotes that e is known with a probability in w, and a probabilistic comparing literal PL(e1, e2) denotes it is known that the probability of e1is less than the one of e2. The semantics of the new language is based on the semantics of LPMLNand epistemic specifications. In this paper, we analyze the relationship between PELP and some other epistemic logic programming languages. We also propose an algorithm for solving PELP programs, and then investigate the application of PELP for modeling and solving the Monty Hall problem and a conformant planning problem with a threshold.