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.