Probabilistic Logic Programs and their Semantics

The aim of this paper is to generalize logic programs, for dealing with probabilistic knowledge. Using the possible-worlds approach of probabilistic logic ([Nil]), we define probabilistic logic programs so that their clauses may be true or false with some probabilities and goals may succeed or fail with probabilities too. Probabilistic logic programs may contain negation, their semantics agrees with negation as failure (unlike probabilistic logic which is based on the standard logical negation).

[1]  Ronald Fagin,et al.  A logic for reasoning about probabilities , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[2]  Nils J. Nilsson,et al.  Probabilistic Logic * , 2022 .

[3]  Adrian Walker,et al.  Towards a Theory of Declarative Knowledge , 1988, Foundations of Deductive Databases and Logic Programming..

[4]  Christos H. Papadimitriou,et al.  Probabilistic satisfiability , 1988, J. Complex..

[5]  Ehud Y. Shapiro,et al.  Logic Programs With Uncertainties: A Tool for Implementing Rule-Based Systems , 1983, IJCAI.

[6]  David Harel,et al.  Horn Clauses Queries and Generalizations , 1985, J. Log. Program..

[7]  Leon Sterling,et al.  The Art of Prolog , 1987, IEEE Expert.

[8]  Kenneth A. Ross,et al.  Unfounded sets and well-founded semantics for general logic programs , 1988, PODS.

[9]  Robert A. Kowalski,et al.  The Semantics of Predicate Logic as a Programming Language , 1976, JACM.

[10]  Allen Van Gelder,et al.  Negation as Failure using Tight Derivations for General Logic Programs , 1988, J. Log. Program..