The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.07 - July (2004 vol.30)
pp: 448-457
ABSTRACT
<p><b>Abstract</b>—A rule-based system must satisfy stringent timing constraints when applied to a real-time environment. As the scale of rule-based expert systems increases, the efficiency of systems becomes a pressing concern. The most critical performance factor in the implementation of a production system is the condition-testing algorithm. We propose a new method based on the widely used RETE match algorithm. We show an approach designed to reduce the response time of rule-based expert systems by reducing the matching time. There are two steps in the method we propose: The first makes an index structure of the tokens to reduce the α-node-level join candidates. The second chooses the highest time tag for certain <tmath>\beta{\hbox{-}}\rm nodes</tmath> to reduce the amount of combinatorial match that is problematical in a real-time production system application. For this purpose, a simple compiler is implemented in C and the response time of test programs is measured.</p>
INDEX TERMS
Matching, knowledge-based systems, expert systems, rule-based systems, OPS5, Rete, response time.
CITATION
Jeong A. Kang, Albert Mo Kim Cheng, "Shortening Matching Time in OPS5 Production Systems", IEEE Transactions on Software Engineering, vol.30, no. 7, pp. 448-457, July 2004, doi:10.1109/TSE.2004.32
473 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool