loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
25th Annual International Computer Software and Applications Conference (COMPSAC'01)
Reducing Matching Time for OPS5 Production Systems
Chicago, Illinois
October 08-October 12
ISBN: 0-7695-1372-7
Jeong A Kang, University of Houston
Albert M.K. Cheng, University of Houston
A rule-based system must satisfy stringent timing con-straints when applied to a real-time environment. The most critical performance factor in the implementation of a pro-duction 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 β-node-level join candidates. The second chooses the highest time tag for certain β-nodes to reduce the size of the β-memory and to keep the strategy of the RETE network. These steps reduce the amount of combinatorial match that is problem-atical in a real-time production system application.
Citation:
Jeong A Kang, Albert M.K. Cheng, "Reducing Matching Time for OPS5 Production Systems," compsac, pp.429, 25th Annual International Computer Software and Applications Conference (COMPSAC'01), 2001
Usage of this product signifies your acceptance of the Terms of Use.