DocumentCode
1727301
Title
Reducing matching time for OPS5 production systems
Author
Kang, Jeong A. ; Cheng, Albert M K
Author_Institution
Real-Time Syst. Lab., Houston Univ., TX, USA
fYear
2001
fDate
6/23/1905 12:00:00 AM
Firstpage
429
Lastpage
434
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 α-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 problematical in a real-time production system application
Keywords
expert systems; knowledge representation; knowledge representation languages; pattern matching; real-time systems; α-node-level-join candidates; β-memory; β-nodes; OPS5 production systems; RETE; combinatorial match; condition-testing algorithm; critical performance factor; highest time tag; index structure; matching time reduction; production system; real-time environment; real-time production system application; rule-based expert systems; rule-based system; stringent timing constraints; Databases; Delay; Engines; Expert systems; Knowledge based systems; Process control; Production systems; Real time systems; Time factors; Timing;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Software and Applications Conference, 2001. COMPSAC 2001. 25th Annual International
Conference_Location
Chicago, IL
ISSN
0730-3157
Print_ISBN
0-7695-1372-7
Type
conf
DOI
10.1109/CMPSAC.2001.960649
Filename
960649
Link To Document