摘要
文中给出含多重原子公式交集的概率逻辑分解计算模型的可靠性证明．若概率逻辑公式集可被划分为含多重原子交集的子集，且交集的原子个数较少，则分解算法将明显地缩小概率逻辑自动推理线性规划模型的规模．
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.
出处
《计算机研究与发展》
EI
CSCD
北大核心
1998年第8期673-677,共5页
Journal of Computer Research and Development
基金
国家自然科学基金
国家"863"高科技项目基金
关键词
概率逻辑
自动推理
不确定性推理
分解算法
probabilistic logic automatic reasoning,uncertainty reasoning,decomposition algorithm
