%0 Journal Article
%T The Completeness of the Super-tree-like Decomposition Model for Probabilistic Logic<br>概率逻辑类超树结构分解计算模型的完备性
%A ZHANG Chen-dong
%A CHEN Huo-wang
%A WANG Bing-shan
%A XU Guang
%A <br>张晨东
%A 陈火旺
%A 王兵山
%A 徐　光
%J 软件学报
%D 1998
%I 
%X 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.
%K Probabilistic logic
%K reasoning in uncertainty
%K decomposition algorithm<br>概率逻辑
%K 不确定性推理
%K 分解算法.
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=15EDA8CB3013B938&yid=8CAA3A429E3EA654&vid=9CF7A0430CBB2DFD&iid=E158A972A605785F&sid=9F8C5EF901EA1E7E&eid=7979125BBE749348&journal_id=1000-9825&journal_name=软件学报&referenced_num=1&reference_num=9