The Rete Algorithm Improvement and Implementation

Rete algorithm is the most efficient forward inference algorithm, but it has some shortcomings: it 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. And we use the unjoin method to solve the null join problem. Then give the empirical result to show its feasibility and superiority. At last, we give the future work we should do to improve ulteriorly.