19 search results - page 1 / 4 » Detecting Termination of Active Database Rules Using Symboli... |
ADBIS
2001
Springer
13 years 9 months ago
2001
Springer
One potential problem of active database applications is the non-termination of rules. Although algorithms have been proposed to detect non-termination, almost all provide a conser...
DAGSTUHL
1998
13 years 6 months ago
1998
After brie y reviewing the basic notions and terminology of active rules and relating them to production rules and deductive rules, respectively, we survey a number of formal appro...
DEXA
2003
Springer
13 years 10 months ago
2003
Springer
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 sugg...
DEDUCTIVE
1994
13 years 6 months ago
1994
Recent advances in non-monotonic semantics of deductive databases provide a simple framework for modeling the even-condition-action rules of active databases. This approach unifie...
RTSS
2008
IEEE
13 years 11 months ago
2008
IEEE
In this paper, we address the problem of symbolically computing the region in the parameter’s space that guarantees a feasible schedule, given a set of real-time tasks character...