| 一种求解与/或树的Petri网方法 |
| |
| 引用本文： | 王淑礼,孙芳.一种求解与/或树的Petri网方法[J].电脑开发与应用,2005,18(9):9-10. |
| |
| 作者姓名： | 王淑礼 孙芳 |
| |
| 作者单位： | 信阳师范学院,信阳,464000;信阳师范学院,信阳,464000 |
| |
| 摘 要： | 研究了用Petri网求解人工智能中与/或树的问题,提出了一种把与/或树转换成相应的Petri网,并通过其逆网求得原与/或树的解树的方法,可进而利用模糊Petri网的推理得到与/或树的最优解树。该方法直观高效,拓宽了Petri网的应用领域。
|
| 关 键 词： | Petri网 逆网 解树 与/或树 |
| 文章编号： | 1003-5850（2005）09-0009-03 |
| 收稿时间： | 2005-02-05 |
| 修稿时间： | 2005-02-052005-07-25 |
A Petri Net Method to Solve AND/OR Tree |
| |
| Wang ShuLi;Sun Fang.A Petri Net Method to Solve AND/OR Tree[J].Computer Development & Applications,2005,18(9):9-10. |
| |
| Authors: | Wang ShuLi;Sun Fang |
| |
| Abstract: | This paper studies how to solve AND/OR tree in Artificial Intelligence with Petri Net,and presents a way that first converts a AND/OR tree to the relative Petri Net,and then obtains a solution tree of the original AND/OR tree through its reverse tree,and finally gets the optimal solution tree of AND/OR tree with fuzzy Petri Net inference. |
| |
| Keywords: | Petri Net reserve net solution tree AND/OR tree |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
