TY - GEN
T1 - An implementation and evaluation of the refined triggering graph method for active rule termination analysis
AU - Tschudi, Michael K.
AU - Urban, Susan D.
AU - Dietrich, Suzanne
AU - Karadimce, Anton P.
N1 - Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1997.
PY - 1997
Y1 - 1997
N2 - This paper describes the implementation of the Refined Triggering Graph (RTG) method for active rule termination analysis. The RTG method has been defined in the context of an active, deductive, object-oriented database language known as CDOL (Comprehensive, Declarative, Object Language). The RTG method studies the contents of rule pairs and rule cycles in a triggering graph and tests for: 1) the successful unification of one rule's action with another rule’s triggering event, and 2) the satisfiability of active rule conditions, asking if it is possible for the condition of a triggered rule to evaluate to true in the context of the triggering rule’s condition. If the analysis can provably demonstrate that one rule cannot trigger another rule, the directed vector connecting the two rules in a basic triggering graph can be removed, thus refining the triggering graph. Two important aspects in the implementation of the method include the development of a satisfiability algorithm for CDOL conditions and the extension of the RTG method with knowledge of the rule execution semantics. The effectiveness of the approach within the context of the sample application is also addressed.
AB - This paper describes the implementation of the Refined Triggering Graph (RTG) method for active rule termination analysis. The RTG method has been defined in the context of an active, deductive, object-oriented database language known as CDOL (Comprehensive, Declarative, Object Language). The RTG method studies the contents of rule pairs and rule cycles in a triggering graph and tests for: 1) the successful unification of one rule's action with another rule’s triggering event, and 2) the satisfiability of active rule conditions, asking if it is possible for the condition of a triggered rule to evaluate to true in the context of the triggering rule’s condition. If the analysis can provably demonstrate that one rule cannot trigger another rule, the directed vector connecting the two rules in a basic triggering graph can be removed, thus refining the triggering graph. Two important aspects in the implementation of the method include the development of a satisfiability algorithm for CDOL conditions and the extension of the RTG method with knowledge of the rule execution semantics. The effectiveness of the approach within the context of the sample application is also addressed.
UR - http://www.scopus.com/inward/record.url?scp=84957003865&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84957003865&partnerID=8YFLogxK
U2 - 10.1007/3-540-63516-5_22
DO - 10.1007/3-540-63516-5_22
M3 - Conference contribution
AN - SCOPUS:84957003865
SN - 3540635165
SN - 9783540635161
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 133
EP - 148
BT - Rules in Database Systems - 3rd International Workshop, RIDS 1997, Proceedings
A2 - Geppert, Andreas
A2 - Berndtsson, Mikael
PB - Springer Verlag
T2 - 3rd International Workshop on Rules in Database Systems, RIDS 1997
Y2 - 26 June 1997 through 28 June 1997
ER -