减少OPS5生产系统的匹配时间

Jeong A. Kang, A. Cheng
{"title":"减少OPS5生产系统的匹配时间","authors":"Jeong A. Kang, A. Cheng","doi":"10.1109/CMPSAC.2001.960649","DOIUrl":null,"url":null,"abstract":"A rule-based system must satisfy stringent timing constraints when applied to a real-time environment. The most critical performance factor in the implementation of a production system is the condition-testing algorithm. We show an approach designed to reduce the response time of rule-based expert systems by reducing the matching time based on RETE. There are two steps in the method we propose: the first makes an index structure of the tokens to reduce the /spl alpha/-node-level join candidates; the second chooses the highest time tag for certain /spl beta/-nodes to reduce the size of the /spl beta/-memory and to keep the strategy of the RETE network. These steps reduce the amount of combinatorial match that is problematical in a real-time production system application.","PeriodicalId":269568,"journal":{"name":"25th Annual International Computer Software and Applications Conference. COMPSAC 2001","volume":"167 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Reducing matching time for OPS5 production systems\",\"authors\":\"Jeong A. Kang, A. Cheng\",\"doi\":\"10.1109/CMPSAC.2001.960649\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A rule-based system must satisfy stringent timing constraints when applied to a real-time environment. The most critical performance factor in the implementation of a production system is the condition-testing algorithm. We show an approach designed to reduce the response time of rule-based expert systems by reducing the matching time based on RETE. There are two steps in the method we propose: the first makes an index structure of the tokens to reduce the /spl alpha/-node-level join candidates; the second chooses the highest time tag for certain /spl beta/-nodes to reduce the size of the /spl beta/-memory and to keep the strategy of the RETE network. These steps reduce the amount of combinatorial match that is problematical in a real-time production system application.\",\"PeriodicalId\":269568,\"journal\":{\"name\":\"25th Annual International Computer Software and Applications Conference. COMPSAC 2001\",\"volume\":\"167 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-10-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"25th Annual International Computer Software and Applications Conference. COMPSAC 2001\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CMPSAC.2001.960649\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"25th Annual International Computer Software and Applications Conference. COMPSAC 2001","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CMPSAC.2001.960649","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

当应用于实时环境时,基于规则的系统必须满足严格的时间约束。在生产系统的实现中,最关键的性能因素是状态测试算法。我们展示了一种通过减少基于RETE的匹配时间来减少基于规则的专家系统响应时间的方法。在我们提出的方法中有两个步骤:第一步创建令牌的索引结构以减少/spl alpha/-节点级连接候选;二是对某些/spl beta/-节点选择最高时间标签,以减小/spl beta/-内存的大小,并保持RETE网络的策略。这些步骤减少了在实时生产系统应用程序中存在问题的组合匹配的数量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Reducing matching time for OPS5 production systems
A rule-based system must satisfy stringent timing constraints when applied to a real-time environment. The most critical performance factor in the implementation of a production system is the condition-testing algorithm. We show an approach designed to reduce the response time of rule-based expert systems by reducing the matching time based on RETE. There are two steps in the method we propose: the first makes an index structure of the tokens to reduce the /spl alpha/-node-level join candidates; the second chooses the highest time tag for certain /spl beta/-nodes to reduce the size of the /spl beta/-memory and to keep the strategy of the RETE network. These steps reduce the amount of combinatorial match that is problematical in a real-time production system application.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信