| 通过广度优先搜索有向图重组规则次序 |
| |
| 引用本文： | 温静. 通过广度优先搜索有向图重组规则次序[J]. 湖北大学学报(自然科学版), 2004, 26(4): 294-296 |
| |
| 作者姓名： | 温静 |
| |
| 作者单位： | 湖北大学,数学与计算机科学学院,湖北,武汉,430062 |
| |
| 基金项目： | 塔里木油田乙方队伍考核网资助项目 |
| |
| 摘 要： | 一个知识库系统性能的验证不仅仅局限于检测系统的功能特性，比如它的输入一输出，而且史重要的是必须体现它的动态特性，比如运行时间效率．提出了通过重新排列规则次序来提高推理效率的思想，并举出一个具体例子来阐述采用广度优先搜索有向图的算法重组规则次序．
|
| 关 键 词： | 广度优先搜索 有向图 规则次序 运行时间效率 |
| 文章编号： | 1000-2375(2004)04-0294-03 |
| 修稿时间： | 2004-03-09 |
Reordering rule sequences by breadth-first searching directed graph |
| |
| WEN Jing. Reordering rule sequences by breadth-first searching directed graph[J]. Journal of Hubei University(Natural Science Edition), 2004, 26(4): 294-296 |
| |
| Authors: | WEN Jing |
| |
| Abstract: | The Valiadtion of a KBS Should not be limited to testing functional properties of the system,such as its input-output behavior, but must also address its dynamic properties, such as its run-time performance. The idea is suggested that to improve inference effciency by reordering rule sequences, and illustrate a algorithm of breadth-first searching directed graph to implement the idea by using a specific example. |
| |
| Keywords: | breadth-first searching directed graph rule suquences run-time efficiency |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
