Termination and confluence of rule execution
Termination and confluence of rule execution
复制标题
规则执行的终止和汇合
DOI:
10.1145/170088.170142
复制
发表时间:
1993
期刊:
影响因子:
--
通讯作者:
A. Siebes
中科院分区:
文献类型:
--
作者:
L. Voort;A. Siebes
Rules provide the functionality for constraint enforcement and view maintenance. A provably correct mplementation of both issues based on rules, requires onfluent and terminating behaviour of the rule set. Iowever, little work has been done so far on the static letection of these properties. In this paper, a design heory for rule sets in an 00DBMS is developed. This paper introduces two predicates, viz., Terninat e(n) and Independent, which imply respectively ermination and confluence. Both predicates are char~cterised under two kinds of rule execution seman,ics: set and instance based. The decidability of he predicates is proven and it is shown that set and nstance based semantics coincide whenever the rule let is independent and terminates. Moreover, sufficient conditions of low algorithmic complexity for both 17erminate(n) and Independent under both kinds of senantics are given.