Termination and Confluence of Rule Execution
Rules provide the functionality for constraint enforcement and view maintenance. A provably correct implementation of both issues based on rules, requires confluent and terminating behaviour of the rule set. However, little work has been done so far on the static detection of these properties. In th...
Main Authors: | , , , |
---|---|
Other Authors: | |
Format: | Text |
Language: | English |
Published: |
Springer-Verlag
1993
|
Subjects: | |
Online Access: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.31.5400 |
id |
ftciteseerx:oai:CiteSeerX.psu:10.1.1.31.5400 |
---|---|
record_format |
openpolar |
spelling |
ftciteseerx:oai:CiteSeerX.psu:10.1.1.31.5400 2023-05-15T16:01:54+02:00 Termination and Confluence of Rule Execution M.H. van der Voort A.P.J.M. Siebes Leonie Van Der Voort Arno Siebes The Pennsylvania State University CiteSeerX Archives 1993 application/postscript http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.31.5400 en eng Springer-Verlag http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.31.5400 Metadata may be used without restrictions as long as the oai identifier remains attached to it. ftp://ftp.cwi.nl/pub/CWIreports/AA/CS-R9309.ps.Z 1991 CR Categories H.2.1[Information Systems Logical Design- data models H.2.3[Information Systems Languages- data description languages(DDL data manipulation languages(DML text 1993 ftciteseerx 2016-01-07T22:28:16Z Rules provide the functionality for constraint enforcement and view maintenance. A provably correct implementation of both issues based on rules, requires confluent and terminating behaviour of the rule set. However, little work has been done so far on the static detection of these properties. In this paper, a design theory for rule sets in an OODBMS is developed. This paper introduces two predicates, viz., Terminate(n) and Independent, which imply respectively termination and confluency. Both predicates are characterised under two kinds of rule execution semantics: set and instance based. The decidability of the predicates is proven and it is shown that set and instance based semantics coincide whenever the rule set is independent and terminates. Moreover, sufficient conditions of low algorithmic complexity for both Terminate(n) and Independent under both kinds of semantics are given. 1991 CR Categories: H.2.1[Information Systems]: Logical Design- data models; H.2.3[Informat. Text DML Unknown |
institution |
Open Polar |
collection |
Unknown |
op_collection_id |
ftciteseerx |
language |
English |
topic |
1991 CR Categories H.2.1[Information Systems Logical Design- data models H.2.3[Information Systems Languages- data description languages(DDL data manipulation languages(DML |
spellingShingle |
1991 CR Categories H.2.1[Information Systems Logical Design- data models H.2.3[Information Systems Languages- data description languages(DDL data manipulation languages(DML M.H. van der Voort A.P.J.M. Siebes Leonie Van Der Voort Arno Siebes Termination and Confluence of Rule Execution |
topic_facet |
1991 CR Categories H.2.1[Information Systems Logical Design- data models H.2.3[Information Systems Languages- data description languages(DDL data manipulation languages(DML |
description |
Rules provide the functionality for constraint enforcement and view maintenance. A provably correct implementation of both issues based on rules, requires confluent and terminating behaviour of the rule set. However, little work has been done so far on the static detection of these properties. In this paper, a design theory for rule sets in an OODBMS is developed. This paper introduces two predicates, viz., Terminate(n) and Independent, which imply respectively termination and confluency. Both predicates are characterised under two kinds of rule execution semantics: set and instance based. The decidability of the predicates is proven and it is shown that set and instance based semantics coincide whenever the rule set is independent and terminates. Moreover, sufficient conditions of low algorithmic complexity for both Terminate(n) and Independent under both kinds of semantics are given. 1991 CR Categories: H.2.1[Information Systems]: Logical Design- data models; H.2.3[Informat. |
author2 |
The Pennsylvania State University CiteSeerX Archives |
format |
Text |
author |
M.H. van der Voort A.P.J.M. Siebes Leonie Van Der Voort Arno Siebes |
author_facet |
M.H. van der Voort A.P.J.M. Siebes Leonie Van Der Voort Arno Siebes |
author_sort |
M.H. van der Voort |
title |
Termination and Confluence of Rule Execution |
title_short |
Termination and Confluence of Rule Execution |
title_full |
Termination and Confluence of Rule Execution |
title_fullStr |
Termination and Confluence of Rule Execution |
title_full_unstemmed |
Termination and Confluence of Rule Execution |
title_sort |
termination and confluence of rule execution |
publisher |
Springer-Verlag |
publishDate |
1993 |
url |
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.31.5400 |
genre |
DML |
genre_facet |
DML |
op_source |
ftp://ftp.cwi.nl/pub/CWIreports/AA/CS-R9309.ps.Z |
op_relation |
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.31.5400 |
op_rights |
Metadata may be used without restrictions as long as the oai identifier remains attached to it. |
_version_ |
1766397586873253888 |