Non-monotonic negation in probabilistic deductive databases

Authors:
Raymond T. Ng;V. S. Subrahmanian
Affiliations:
Deparment of Computer Science, University of Maryland, College Park, Maryland;Deparment of Computer Science, University of Maryland, College Park, Maryland
Venue:
UAI'91 Proceedings of the Seventh conference on Uncertainty in Artificial Intelligence
Year:
1991

Citing 14
Cited 0

Probabilistic logic

Artificial Intelligence
Quantitative deduction and its fixpoint theory

Journal of Logic Programming
Paraconsistent logic programming

Proc. of the seventh conference on Foundations of software technology and theoretical computer science
Default reasoning and possibility theory

Artificial Intelligence
Probabilistic reasoning in intelligent systems: networks of plausible inference

Probabilistic reasoning in intelligent systems: networks of plausible inference
RI: A logic for reasoning with inconsistency

Proceedings of the Fourth Annual Symposium on Logic in computer science
A logic for reasoning about probabilities

Information and Computation - Selections from 1988 IEEE symposium on logic in computer science
A semantical framework for supporting subjective and conditional probabilities in deductive databases

A semantical framework for supporting subjective and conditional probabilities in deductive databases
Bilattices and the semantics of logic programming

Journal of Logic Programming
Probabilistic reasoning in logic programming

Methodologies for intelligent systems, 5
Theory of generalized annotated logic programming and its applications

Journal of Logic Programming
Stable and extension class theory for logic programs and default logics

Journal of Automated Reasoning
On interacting defaults

IJCAI'81 Proceedings of the 7th international joint conference on Artificial intelligence - Volume 1
Uncertainty, belief, and probability

IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we study the uses and the semantics of non-monotonic negation in probabilistic deductive data bases. Based on the stable semantics for classical logic programming, we introduce the notion of stable formula, functions. We show that stable formula, functions are minimal fixpoints of operators associated with probabilistic deductive databases with negation. Furthermore, since a. probabilistic deductive database may not necessarily have a stable formula function, we provide a stable class semantics for such databases. Finally, we demonstrate that the proposed semantics can handle default reasoning naturally in the context of probabilistic deduction.