###
DOI:
:1994.5(2):43-47

对Etherington并行网络推理算法不完整性问题的探讨
范仲春
(南京师范大学,南京 210024)
DISCUSSION ON INCOMPLETENESS PROBLEM OF ETHERINGTON′S PARALLEL NETWORK INFERENCE ALGORITHM
Fan Zhongchun
()
Abstract
Chart / table
Reference
Similar Articles
Article :Browse 2544   Download 2484
    Revised:September 13, 1991
> 中文摘要: 网络缺省推理中扩展的计算需要进行并行性处理.Etherington的并行网络推理算法(PNIA)为缺省推理提供了一条有效的途径.但它存在不能穷尽所有扩展的不完整性问题.本文提出了一个解决这一不完整性间题的并行网络推理算法.
Abstract:he computational complexity of default reasoning has sparked interest in the possibility of determining extension in parallel. The Parallel Network Inference Algorithm (PNIA) of Etherington has supplied default reasoning with an effective approach,but it can’t compute all extensions,i. e., there is a problem of incompleteness in PNIA. In order to solve this problem, this paper presents a new parallel network inference algorithm.
文章编号:     中图分类号:    文献标志码:
基金项目:
Foundation items:
Author NameAffiliation
Fan Zhongchun 南京师范大学南京 210024 
Reference text:

范仲春.对Etherington并行网络推理算法不完整性问题的探讨.软件学报,1994,5(2):43-47

Fan Zhongchun.DISCUSSION ON INCOMPLETENESS PROBLEM OF ETHERINGTON′S PARALLEL NETWORK INFERENCE ALGORITHM.Journal of Software,1994,5(2):43-47