Constraint-based termination analysis for cyclic active database rules

Saumya Debray, Timothy Hickey

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Scopus citations

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.

Original languageEnglish (US)
Title of host publicationComputational Logic - CL 2000 - 1st International Conference, Proceedings
EditorsJohn Lloyd, Veronica Dahl, Ulrich Furbach, Manfred Kerber, Kung-Kiu Lau, Catuscia Palamidessi, Luís Moniz Pereira, Yehoshua Sagiv, Peter J. Stuckey
PublisherSpringer-Verlag
Pages1121-1136
Number of pages16
ISBN (Electronic)3540677976, 9783540677970
DOIs
StatePublished - 2000
Event1st International Conference on Computational Logic, CL 2000 - London, United Kingdom
Duration: Jul 24 2000Jul 28 2000

Publication series

NameLecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)
Volume1861
ISSN (Print)0302-9743

Other

Other1st International Conference on Computational Logic, CL 2000
Country/TerritoryUnited Kingdom
CityLondon
Period7/24/007/28/00

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint

Dive into the research topics of 'Constraint-based termination analysis for cyclic active database rules'. Together they form a unique fingerprint.

Cite this