###
DOI:
Journal of Software:1998.9(4):273-275

概率逻辑类超树结构分解计算模型的完备性
张晨东,陈火旺,王兵山,徐 光
(长沙工学院计算机系,长沙,410073;空军指挥学院,北京,100081)
The Completeness of the Super-tree-like Decomposition Model for Probabilistic Logic
ZHANG Chen-dong,CHEN Huo-wang,WANG Bing-shan,XU Guang
()
Abstract
Chart / table
Reference
Similar Articles
Article :Browse 3379   Download 2489
Received:February 20, 1997    Revised:May 07, 1997
> 中文摘要: 针对Nilsson概率逻辑推理在计算规模方面存在的问题,本文给出了公式集按类超树结构分解的计算模型,并证明了分解算法的完备性.
Abstract: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.
文章编号:     中图分类号:    文献标志码:
基金项目:本文研究得到国家自然科学基金和国家863高科技项目基金资助. 本文研究得到国家自然科学基金和国家863高科技项目基金资助.
Foundation items:
Reference text:

张晨东,陈火旺,王兵山,徐 光.概率逻辑类超树结构分解计算模型的完备性.软件学报,1998,9(4):273-275

ZHANG Chen-dong,CHEN Huo-wang,WANG Bing-shan,XU Guang.The Completeness of the Super-tree-like Decomposition Model for Probabilistic Logic.Journal of Software,1998,9(4):273-275