| 摘要: |
| 网络缺省推理中扩展的计算需要进行并行性处理．Ｅｔｈｅｒｉｎｇｔｏｎ的并行网络推理算法（ＰＮＩＡ）为缺省推理提供了一条有效的途径．但它存在不能穷尽所有扩展的不完整性问题．本文提出了一个解决这一不完整性间题的并行网络推理算法． |
| 关键词: 缺省推理 例外 扩展 网络缺省理论 并行网络推理算法 |
| DOI： |
| 分类号: |
| 基金项目: |
|
| DISCUSSION ON INCOMPLETENESS PROBLEM OF ETHERINGTON′S PARALLEL NETWORK INFERENCE ALGORITHM |
|
Fan Zhongchun
|
| 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. |
| Key words: Default reasoning exception extension network default theory parallel network inference algorithm |
