Hostname: page-component-586b7cd67f-t7czq Total loading time: 0 Render date: 2024-11-28T14:59:05.516Z Has data issue: false hasContentIssue false
  • English
  • Français

Declarative semantics for active rules

Published online by Cambridge University Press:  03 April 2001

SERGIO FLESCA  and
SERGIO GRECO
SERGIO FLESCA
Affiliation:
DEIS, Università della Calabria, 87030 Rende, Italy (e-mail: [email protected])
SERGIO GRECO
Affiliation:
DEIS, Università della Calabria, and ISI-CNR, 87030 Rende, Italy (e-mail: [email protected])
Get access Rights & Permissions [Opens in a new window]

Abstract

In this paper we analyze declarative deterministic and non-deterministic semantics for active rules. In particular, we consider several (partial) stable model semantics, previously defined for deductive rules, such as well-founded, max deterministic, unique total stable model, total stable model and maximal stable model semantics. The semantics of an active program [Ascr ][Pscr ] is given by first rewriting it into a deductive program [Lscr ][Pscr ], then computing a model M defining the declarative semantics of [Lscr ][Pscr ] and, finally, applying ‘consistent’ updates contained in M to the source database. The framework we propose permits a natural integration of deductive and active rules and can also be applied to queries with function symbols or to queries over infinite databases.

Keywords

active databasesdeductive databasessemanticsstable models
Type
Research Article
Information
Theory and Practice of Logic Programming , Volume 1 , Issue 1 , January 2001 , pp. 43 - 69
Copyright
© 2001 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)