AAAI Publications, Twenty-First International Joint Conference on Artificial Intelligence

Font Size: 
A Syntax-based Framework for Merging Imprecise Probabilistic Logic Programs
Anbu Yue, Weiru Liu

Last modified: 2009-06-26


In this paper, we address the problem of merging multiple imprecise probabilistic beliefs represented as Probabilistic Logic Programs (PLPs) obtained from multiple sources. Beliefs in each PLP are modeled as conditional events attached with probability bounds. The major task of syntax-based merging is to obtain the most rational probability bound for each conditional event from the original PLPs to form a new PLP. We require the minimal change principle to be followed so that each source gives up its beliefs as little as possible. Some instantiated merging operators are derived from our merging framework. Furthermore, we propose a set of postulates for merging PLPs, some of which extend the postulates for merging classical knowledge bases, whilst others are specific to the merging of probabilistic beliefs.


Merging; Probabilistic Logic

Full Text: PDF