理想AND/OR图搜索策略的推广  

Extension of Search Strategies on Ideal AND/OR Graphs

作　　者：杨宁学[1] 龚晖[1] 

机构地区：[1]西南交通大学应用力学与工程系,四川成都610031

出　　处：《西南交通大学学报》2005年第1期49-52,共4页Journal of Southwest Jiaotong University

基　　金：世界银行贷款21世纪初高等教育教学改革项目(1282C03041)

摘　　要：SUB和COM是专家系统推理网络图中常见的关系算子,AND和OR分别是SUB和COM算子的特例.建立在理想AND/OR图上的半景搜索法和最大优势搜索法可以推广到包含SUB和COM算子的理想非AND/OR图的搜索,而最大超越搜索法则可推广到包含回路结构的非理想AND/OR图的搜索.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.

关 键 词：专家系统 搜索策略 与/或图 半景搜索法 最大优势搜索法 最大超越搜索法 

分 类 号：TP182[自动化与计算机技术—控制理论与控制工程]