Declarative Semantics for Active Rules
| dc.creator | Flesca, Sergio | |
| dc.creator | Greco, Sergio | |
| dc.date | 2003-12-18 | |
| dc.date.accessioned | 2026-07-07T03:20:45Z | |
| dc.date.available | 2026-07-07T03:20:45Z | |
| dc.description | 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 AP is given by first rewriting it into a deductive program P, then computing a model M defining the declarative semantics of P 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. | |
| dc.description | 27 pages | |
| dc.identifier | https://arxiv.org/abs/cs/0312042 | |
| dc.identifier | http://arxiv.org/abs/cs/0312042 | |
| dc.identifier | Theory and Practice of Logic Programming, 1(1): 43-69, 2001 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/31938 | |
| dc.subject | Databases | |
| dc.subject | D.1.6; F.3.1; F.4.1 | |
| dc.title | Declarative Semantics for Active Rules | |
| dc.type | text |