In this paper we analyze declarative determinstic semantics for active rules.In particular we consider determinstic (partial) stable model semantics previously defiend for deductive rules such as well-founded,max-deterministic,and unique total stable semantics.The semantics of an active progrma AP is given by first rewriting it into a deductive program LP,ocmputing the model M defining hte declarative semantics of LP and ,finally,applying concsistent' updates contained in M to the souce database.
展开▼
