English

应用科学学报 ›› 1990, Vol. 8 ›› Issue (4): 349-353.

• 论文 • 上一篇    下一篇

推理网络的回路识别算法

吴信东, 方轮   

  1. 合肥工业大学
  • 收稿日期:1989-07-10 修回日期:1989-11-07 出版日期:1990-12-31 发布日期:1990-12-31

A CYCLE RECOGNITION ALGORITHM FOR REASONING NETWORKS

WU XINDONG, FANG LUN   

  1. Hefei University of Technology
  • Received:1989-07-10 Revised:1989-11-07 Online:1990-12-31 Published:1990-12-31

PDF

107

被引次数

3

摘要： 推理网络是一种特殊的有向图,有效地识别出推理网络中的回路不仅对电路分析和图论研究有意义,而且对智能计算机系统的自动知识获取更有着特殊意义.该文设计并用Turbo-PROLOG语言实现了一个推理网络的回路识别算法,该算法也适用于一般形式的有向图.

Abstract: A reasoning network is a special directed graph. Efficiently recognizing possible cycles in reasoning networks is useful not only in electronic networks and graph theory but also in automated knowledge acquisition research of intelligent systems. This paper designs a cycle recognition algorithm for reasoning networks and implements it in Turbo-PROLOG language. The algorithm can also be used for general directed graphs.