基于条件公式的主动规则集可终止性判定  

Determination of termination for a rule set based on conditional formula

作　　者：熊中敏[1,2] 郝忠孝[1,3] 

机构地区：[1]哈尔滨理工大学计算机与控制学院,哈尔滨150080 [2]上海海洋大学信息学院,上海201306 [3]哈尔滨工业大学计算机科学与技术学院,哈尔滨150001

出　　处：《哈尔滨工业大学学报》2009年第5期221-225,共5页Journal of Harbin Institute of Technology

基　　金：科技部科研专项经费基金资助项目(200805016);上海市科委重大专项资助项目(08dz1204802);黑龙江省自然科学基金资助项目(F00-06)

摘　　要：针对利用触发图和活化图的方法来判定主动规则集的可终止性存在一定的局限性,从而影响了运行阶段规则系统的执行效率并限制了主动规则在众多领域中的灵活应用的问题.提出了利用基于活化路径建立的条件公式进行判定的方法,结果表明该方法可以比现有方法发现更多的可终止性情形.对主动规则集的设计和应用具有一定的意义.To overcome the defect that active rules termination proved by triggering and activation graphs is conservative in active database, and improve the efficiency of run-time rule analysis, the conditional formula constructing for an activation path is proposed in this paper and a novel approach to determine the termination of active rules set is presented. Analytical results prove that the proposed approach can detect more termination situations than existing methods. The work done in this paper will give some help for the design and application of active rules

关 键 词：主动数据库 规则分析 活化路径 条件公武 可终止性 

分 类 号：TP311.131[自动化与计算机技术—计算机软件与理论]