Skip to main content
Conference Proceedings

A model theoretic approach to update rule programs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1997) 1186 173-187
DOI: 10.1007/3-540-62222-5_44
5Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Semantics of active rules is generally defined by execution models. The lack of a clean declarative semantics threats active system reliability. In this paper, a declarative semantics for update rules based on the well founded semantics of Datalog programs is investigated. The validation of our proposal proceeds by demonstrating it for static and transition integrity constraint enforcement.

Author supplied keywords

Cite

CITATION STYLE

APA

Bidoit, N., & Maabout, S. (1997). A model theoretic approach to update rule programs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1186, pp. 173–187). Springer Verlag. https://doi.org/10.1007/3-540-62222-5_44

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free