VALIDITY OF THE DECOMPOSITION MODEL WITH CONJUNCTION OF MULTI ATOMIC SETS FOR PROBABILISTIC LOGIC

The validity of the decomposition model with conjunction of multi atomic sets for probabilistic logic reasoning is proved in the paper.If the probabilistic logic formula set can be divided into several sub sets with the same conjunction atomic set that contains not many atomic formulas,the decomposition model is able to reduce the scale of the linear programming considerably and to simplify the algorithm.