ACM Home Page
Please provide us with feedback. Feedback
Termination analysis of active rules modular sets
Full text PdfPdf (1.44 MB)
Source Conference on Information and Knowledge Management archive
Proceedings of the tenth international conference on Information and knowledge management table of contents
Atlanta, Georgia, USA
Session: Potpourri table of contents
Pages: 326 - 333  
Year of Publication: 2001
ISBN:1-58113-436-3
Author
Alain Couchot  University Paris Val de Marne, Créteil, France
Sponsors
SIGMIS: ACM Special Interest Group on Management Information Systems
SIGIR: ACM Special Interest Group on Information Retrieval
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 20,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/502585.502640
What is a DOI?

ABSTRACT

This paper presents an algorithm for static termination analysis of active rules in a context of modular design. Several recent works have suggested proving termination by using the concept of triggering graph. We propose here an original approach, based on these works, and that allows to guarantee the termination of a set of rules, conceived by several designers, even when none of the designers knows the set of the active rules. We introduce the notions of private event and of public event, and we refine the notion of triggering graph (by enclosing also events in graphs). We replace then the notion of cycle (which is no more relevant in a context of modular design) by the notion of maximal private path preceding a rule. By means of these tools, we show that it is possible to prove termination of active rules modular sets.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
 
3
4
 
5
 
6
 
7
 
8
 
9
 
10
 
11
 
12
 
13
T. Weik, A. Heuer. An Algorithm for the Analysis of Termination of Large Trigger Sets in an OODBMS. In Proc. Int' I Workshop on Active and ReaFime Databases. Skoevde, Sweden, 1995.