首页 | 本学科首页   官方微博 | 高级检索  
     检索      

理想AND/OR图搜索策略的推广
引用本文:杨宁学,龚晖.理想AND/OR图搜索策略的推广[J].西南交通大学学报,2005,40(1):49-52.
作者姓名:杨宁学  龚晖
作者单位:西南交通大学应用力学与工程系,四川,成都,610031
基金项目:世界银行贷款21世纪初高等教育教学改革项目(1282C03041)
摘    要:SUB和COM是专家系统推理网络图中常见的关系算子,AND和OR分别是SUB和COM算子的特例.建立在理想AND/OR图上的半景搜索法和最大优势搜索法可以推广到包含SUB和COM算子的理想非AND/OR图的搜索,而最大超越搜索法则可推广到包含回路结构的非理想AND/OR图的搜索.

关 键 词:专家系统  搜索策略  与/或图  半景搜索法  最大优势搜索法  最大超越搜索法
文章编号:0258-2724(2005)01-0049-04

Extension of Search Strategies on Ideal AND/OR Graphs
YANG Ning-xue,GONG Hui.Extension of Search Strategies on Ideal AND/OR Graphs[J].Journal of Southwest Jiaotong University,2005,40(1):49-52.
Authors:YANG Ning-xue  GONG Hui
Abstract:SUB and COM are very important operators frequently used in reasoning network graphs of expert systems. AND and OR are the special cases of SUB and COM. The half scenery search method and the maximum superiority search method developed for searching ideal AND/OR graphs can be extended to searching ideal non-AND/OR graphs containing SUB and COM operators, and the maximum reliability search method for searching ideal AND/OR graphs is applicable to the non-ideal AND/OR graphs containing circuit structures.
Keywords:expert systems  search strategies  AND/OR graphs  half scenery search method  maximum superiority search method  maximum reliability search method
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号