|
 
|
[COU03a] Termination Analysis of Active Rules with Priorities
Conférence Internationale avec comité de lecture : 14th Int. Conf. on Databases and Expert Systems Applications (DEXA), January 2003, pp.846-855,Mots clés: Active databases
Résumé:
This paper presents an algorithm for termination static analysis of active rules
with priorities. Active rules termination is an undecidable problem. Several recent works
have suggested proving termination by using the concept of triggering graph. We propose
here a refinement of these works, exploiting the priorities defined between rules. We
introduce the notions of path set and destabilizing set. We show how to determine the
priority of a path set. The triggering graph can then be reduced thanks to considerations
about priorities of the path sets. Much more termination situations can be detected, since
priorities are exploited.
BibTeX
| @inproceedings { | |||
| COU03a, | |||
| title | = | "{Termination Analysis of Active Rules with Priorities}", | |
| author | = | " A. Couchot ", | |
| booktitle | = | "{14th Int. Conf. on Databases and Expert Systems Applications (DEXA)}", | |
| year | = | 2003, | |
| month | = | "January", | |
| pages | = | "846-855", | |
| } | |||
