The Completeness of the Super-tree-like Decomposition Model for Probabilistic Logic
概率逻辑类超树结构分解计算模型的完备性

In order to reduce the complexity in the calculation model of Nilsson's probabilistic logic, the authors presented a new approach with the super-tree-like decomposition model in this paper, and proved the completeness theorem of the given method.