带有规则优先级的主动规则终止性分析  

Termination analysis of active rules with prioritization

作　　者：杨泽雪[1] 周屹[1] 胡心怡[2] 赵庆双[3] 

机构地区：[1]黑龙江工程学院计算机科学与技术系,黑龙江哈尔滨150050 [2]哈尔滨工业大学电子与信息工程学院,黑龙江哈尔滨150001 [3]哈尔滨师范大学,黑龙江哈尔滨150025

出　　处：《黑龙江工程学院学报》2010年第1期57-59,76,共4页Journal of Heilongjiang Institute of Technology

基　　金：黑龙江省教育厅资助项目(11541291)

摘　　要：主动规则的终止性指规则集的规则之间的相互触发不会无限循环下去,即规则是可终止的。对主动规则的终止性分析方法包括图方法和代数分析方法。针对已有分析方法的局限性,介绍一种主动数据库规则终止性分析的一种新方法,将主动规则翻译成逻辑语句,考虑到系统的执行语义,转换为演绎规则中已知终止性的主动过程,利用该规则终止性分析方法对更多规则进行终止性分析,给出相应定理及其证明,最后给出规则优先级算法。Termination of a set of rules is to generate rules for which it is possible to guarantee rules can not trigger each other infinitely,i, e. , the execution is terminate. The approach for active rules termination analysis include graph and algebraic approach. In order to overcome limitation of existed termination analysis mothod , a new method for rule termination analysis within active databases is introduced. The method translates the active rules into logical clauses, taking into account the system＇s execution semantics, and transfers to the active process known simple results about termination for deductive rules. Termination analysis of more active rules is done by using this termination analysis method of active database, the theorem for testing rule termination is presented and proved to be correct. At last the rule prioritization algorithm is presented.

关 键 词：主动数据库 终止性 演绎数据库 

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