The University of Arizona
banner image

  Constraint-Based Termination Analysis for Cyclic Active Database Rules

Saumya Debray
Department of Computer Science
University of Arizona
Tucson, AZ 85721, USA

Timothy Hickey
Michtom School of Computer Science
Brandeis University Waltham, MA 02454, USA

 

Abstract
There are many situations where cyclic rule activations---where some set of active database rules may be activated repeatedly until the database satisfies some condition---arise naturally. However, most existing approaches to termination analysis of active rules, which typically rely on checking that the triggering graph for the rules is acyclic, cannot infer termination for such rules. We present a constraint-based approach to termination analysis that is able to handle such cyclic rule activations for a wide class of rules.