In this paper we study the uses and the semantics of non-monotonic negationin probabilistic deductive data bases. Based on the stable semantics forclassical logic programming, we introduce the notion of stable formula,functions. We show that stable formula, functions are minimal fixpoints ofoperators associated with probabilistic deductive databases with negation.Furthermore, since a. probabilistic deductive database may not necessarily havea stable formula function, we provide a stable class semantics for suchdatabases. Finally, we demonstrate that the proposed semantics can handledefault reasoning naturally in the context of probabilistic deduction.
展开▼
