Temporal constraints for rule-based event processing
Proceedings of the ACM first Ph.D. workshop in CIKM
Forward chaining in HALO: an implementation strategy for history-based logic pointcuts
ICDL '07 Proceedings of the 2007 international conference on Dynamic languages: in conjunction with the 15th International Smalltalk Joint Conference 2007
Relative temporal constraints in the Rete algorithm for complex event detection
Proceedings of the second international conference on Distributed event-based systems
Forward chaining in HALO: An implementation strategy for history-based logic pointcuts
Computer Languages, Systems and Structures
DEXA '08 Proceedings of the 19th international conference on Database and Expert Systems Applications
Chronicle recognition improvement using temporal focusing and hierarchization
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Event-driven architecture for decision support in traffic management systems
Expert Systems with Applications: An International Journal
RW'07 Proceedings of the Third international summer school conference on Reasoning Web
| Hi-index | 0.00 |
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.