@inproceedings{7bd6a7eb693c4174b9223ad518979a68,
title = "Stable model semantics for probabilistic deductive databases",
abstract = "In this paper we study the uses and the semantics of non-monotonic negation in proba,- bilistie deductive databases. Based on the stable model semantics for classical logic programming, we examine two notions of stability. The first one is stable probabilistie models which are straightforward extensions of the classical stable models. But we prove that this notion may be too weak in our probabilistie framework. Then we introduce the second notion: stable families of probabilistie models. We show that this notion is much stronger than the first one, and we demonstrate how this stable family semantics can handle default reasoning appropriately in the context of probabilistic deduction.",
author = "Raymond Ng and Subrahmanian, {V. S.}",
note = "Funding Information: The semantical approach we adopt is based on the stable semantics of (classical) logic programming with negation [7]. Here we examine two notions of stability that are natural for *This research was partially sponsored by the National Science Foundation under Grant IRI-8719458. tThis research was partially sponsored by the {"}Office of Graduate Studies and Research of the University of Maxyland{"}. Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1991.; 6th International Symposium on Methodologies for Intelligent Systems, ISMIS 1991 ; Conference date: 16-10-1991 Through 19-10-1991",
year = "1991",
doi = "10.1007/3-540-54563-8_80",
language = "English (US)",
isbn = "9783540545637",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "162--171",
editor = "Ras, {Zbigniew W.} and Maria Zemankova",
booktitle = "Methodologies for Intelligent Systems - 6th International Symposium, ISMIS 1991, Proceedings",
}