Declarative Semantics for Active Rules

Details Declarative Semantics for Active Rules Declarative Semantics for Active Rules

2003-12-18

arxiv.org/abs/cs/0312042v1

Theory and Practice of Logic Programming, 1(1): 43-69, 2001

Computer Science

Databases

27 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Declarative Semantics for Active Rules does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Declarative Semantics for Active Rules, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Declarative Semantics for Active Rules will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-307962