Sciweavers

Share
ICLP
2005
Springer

Hybrid Probabilistic Logic Programs with Non-monotonic Negation

12 years 1 months ago
Hybrid Probabilistic Logic Programs with Non-monotonic Negation
1 In [20], a new Hybrid Probabilistic Logic Programs framework is proposed, and a new semantics is developed to enable encoding and reasoning about real-world applications. In this paper, we extend the language of Hybrid Probabilistic Logic Programs framework in [20] to allow non-monotonic negation, and define two alternative semantics: stable probabilistic model semantics and probabilistic well-founded semantics. Stable probabilistic model semantics and probabilistic well-founded semantics generalize stable model semantics and well-founded semantics of traditional normal logic programs, and they reduce to the semantics of original Hybrid Probabilistic Logic programs framework of [20]. It is the first time that two different semantics for Hybrid Probabilistic Programs with non-monotonic negation as well as their relationship are described. This development provides a foundational ground for developing computational methods for computing the proposed semantics. Furthermore, it makes ...
Emad Saad, Enrico Pontelli
Added 27 Jun 2010
Updated 27 Jun 2010
Type Conference
Year 2005
Where ICLP
Authors Emad Saad, Enrico Pontelli
Comments (0)
books