Extending the RETE algorithm for event management
Tóm tắt
A growing number of industrial applications use rule-based programming. Frequently, the implementation of the inference engine embedded in these applications is based on the RETE algorithm. Some applications supervise a flow of events in which time, through the occurrence dates of the events, plays an important role. These applications need to be able to recognize patterns involving events. However the RETE algorithm does not provide support for the expression of time-sensitive patterns. This paper proposes an extension of RETE through the concepts of time-stamped events and temporal constraints between events. This allows applications to write rules that process both facts and events.
Từ khóa
#Engines #Pattern recognition #Clocks #Inference algorithms #Pattern matching #Java #Monitoring #Logic #Time factorsTài liệu tham khảo
10.1016/0004-3702(82)90020-0
fontaine, 1997, An approach by graph for the recognition of temporal scenarios, IEEE Transactions on System Man and Cybernetics
hanson, 1993, Gator: An optimized discrimination network for active database rule condition testing, Technical Report TR03–03
ghallab, 1996, On chronicles: Representation, on-line recognition and learning, Int'l Conf on Principles of Knowledge Representation and Reasoning
10.1207/s15516709cog0602_1
lévy, 1994, Recognising scenarios: a study, Int'l Workshop on Principles of Diagnosis
dousson, 1984, Suivi d'évolutions et reconnaissance de chroniques
miranker, 1987, Treat: A better match algorithm for ai production systems, AAAI Nat Conf
cordier, 2000, Alarm driven monitoring based on chronicles, Safeprocess