Abstract
In this paper we study the uses and the semantics of non-monotonic negation in probabilistic deductive databases. Based on the stable model semantics for classical logic programming, we examine two notions of stability. The first one is stable probabilistic models which are straightforward extensions of the classical stable models. But we prove that this notion may be too weak in our probabilistic framework. Then we introduce the second notion: stable families of probabilistic 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.KeywordsProbabilistic ModelLogic ProgramLogic ProgrammingFunction SymbolProbability AssignmentThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
