Hybrid Probabilistic Logic Programs with Non-monotonic Negation

In [22], a new Hybrid Probabilistic Logic Programs framework has been proposed, and a new semantics has been developed to enable encoding and reasoning about real-world applications. In this paper, the language of Hybrid Probabilistic Logic Programs framework of [22] is extended to allow non-monotonic negation, and two alternative semantics are defined: 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 [22] for programs without negation. It is the first time that two different semantics for Hybrid Probabilistic Programs with non-monotonic negation as well as their relationships are described. This development provides a foundational ground for developing computational methods for computing the proposed semantics. Furthermore, it makes it clearer how to characterize non-monotonic negation in probabilistic logic programming frameworks for commonsense reasoning.

[1]  Jean H. Gallier,et al.  Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae , 1984, J. Log. Program..

[2]  V. S. Subrahmanian,et al.  A semantical framework for supporting subjective and conditional probabilities in deductive databases , 1990, Journal of Automated Reasoning.

[3]  Thomas Lukasiewicz,et al.  Many-Valued Disjunctive Logic Programs with Probabilistic Semantics , 1999, LPNMR.

[4]  Thomas Lukasiewicz,et al.  Probabilistic Logic Programming , 1998, ECAI.

[5]  V. S. Subrahmanian.  Amalgamating knowledge bases , 1994, TODS.

[6]  V. S. Subrahmanian,et al.  Hybrid Probabilistic Programs , 2000, J. Log. Program..

[7]  Enrico Pontelli,et al.  Towards a More Practical Hybrid Probabilistic Logic Programming Framework , 2005, PADL.

[8]  Ilkka Niemelä,et al.  Efficient Implementation of the Well-founded and Stable Model Semantics , 1996, JICSLP.

[9]  Umberto Straccia,et al.  The Well-Founded Semantics in Normal Logic Programs with Uncertainty , 2002, FLOPS.

[10]  Luís Moniz Pereira,et al.  Hybrid Probabilistic Logic Programs as Residuated Logic Programs , 2000, Stud Logica.

[11]  Enrico Pontelli,et al.  Hybrid probabilistic programs with non-monotonic negation: semantics and algorithms , 2005 .

[12]  V. S. Subrahmanian,et al.  Stable Semantics for Probabilistic Deductive Databases , 1994, Inf. Comput..

[13]  autoepistemic Zogic.  Logic programming and negation : a survey , 2001 .

[14]  Laks V. S. Lakshmanan,et al.  On a theory of probabilistic deductive databases , 2001, Theory and Practice of Logic Programming.

[15]  Luís Moniz Pereira,et al.  Coherent Well-founded Annotated Logic Programs , 1999, LPNMR.

[16]  Umberto Straccia,et al.  The Approximate Well-Founded Semantics for Logic Programs with Uncertainty , 2003, MFCS.

[17]  Laks V. S. Lakshmanan,et al.  A Parametric Approach to Deductive Databases with Uncertainty , 2001, IEEE Trans. Knowl. Data Eng..

[18]  Kenneth A. Ross,et al.  The well-founded semantics for general logic programs , 1991, JACM.

[19]  V. S. Subrahmanian,et al.  Theory of Generalized Annotated Logic Programming and its Applications , 1992, J. Log. Program..

[20]  Allen Van Gelder,et al.  The Alternating Fixpoint of Logic Programs with Negation , 1993, J. Comput. Syst. Sci..