An event-oriented inference algorithm with timing constraints

Event streaming processing (ESP) has been well investigated in recent years. Many approaches have been proposed on this aspect. However, none of them considers the timing constraints held by high-level reactive applications. In this paper, we present an event-oriented inference algorithm with timing constraints, called RTEIA, to make automatic decisions about how to react to continuously arriving events (i.e., event streams) so that the deadlines of inference delay for rules can be met as much as possible. Simulation results show that the heuristic searching policy used by RTEIA effectively improves the number of times that rules are fired within the deadlines of their inference delay (NAFS).