检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]哈尔滨工业大学,150006
出 处:《计算机研究与发展》1992年第9期20-26,共7页Journal of Computer Research and Development
摘 要:本文首先通过建立一种状态分析方法,证明了RETE算法所保存的中间状态集IS(P_1)的不完备性,论述了RETE算法用于并行处理的局限性以及产生式间状态处理时间的差异.然后,提出了一种产生式系统并行选择全状态处理模型RETE^+,证明了RETE^+所处理的全状态集FS(P_j)具有准完备性质.计算表明,RETE^+的状态处理时间比RETE快得多,并且消除了状态处理时间差异.最后给出了RETE^+模型的主要算法.First, the non-completeness of the intermediate state set IS(P_j) stored by memories in RETE algorithm is demonstrated in this paper, on the basis of a state analyzing method that we proposed. The limitation and the time variances in using RETE to parallel processing are analysed. Next, RETE^+, a model of parallel selection and full state processing for OPS 5 production system is presented and the almost-completeness of the full state set FS(P_j) processed by RETE^+ is demonstrrated. The calculated results show that the processing time of RETE^+ is by far faster than RETE and the time variances in state processing is eliminated. Last, the main algorithm for RETE^+ model is described.
分 类 号:TP18[自动化与计算机技术—控制理论与控制工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:13.58.11.68