DISCUSSION ON INCOMPLETENESS PROBLEM OF ETHERINGTON′S PARALLEL NETWORK INFERENCE ALGORITHM
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    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.

    Reference
    Related
    Cited by
Get Citation

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

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:
  • Revised:September 13,1991
  • Adopted:
  • Online:
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063