{"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}
引用次数: 5
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.