主动规则集的可终止性判定是主动数据库中核心问题之一，利用触发图和活化图的方法来判定可终止性都存在一定的局限性。

Active rules termination is an important problem in active databases, proving termination by using triggering and activation graphs is a conservative approach.

youdao

本文还探讨了规则分析理论，通过定义触发图、活化图和惰化图，给出一个规则终止性静态分析算法，提高了规则终止性判定的准确性。

In this paper we also discussed the rule analysis theory. By defining trigger graph, active graph and de-active graph we gave a static rule analysis algorithm of deciding of the rule termination.

youdao