Abstract
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).
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Apt,K.R., Blair,H., Walker,A. Towards a theory of declarative knowledge. In: J.Minker (ed.), Foundations of Deductive Databases and Logic Programming, Morgan Kaufmann Publishers, Los Altos, CA, 1988, 89–148.
Chandra,A., Harel,D. Horn clause queries and generalizations. The Journal of Logic Programming 1, 1985, 1–15
van Emden,M.H., Kowalski,R.A, The semantics of predicate logic as a programming language. Journal ACM, 23(4), 1976, 733–742
Fagin,R., Halpern,J.Y., Megiddo,N. A logic for reasoning about probabilities, Proc. 3rd IEEE Symp.on Logic in Computer Science, 1988, 277–291. A revised and expanded version of this paper as IBM Research Report RJ 6190, April 1988.
van Gelder,A. Negation as failure using tight derivations for general logic programs. In: J.Minker (ed.), Foundations of Deductive Databases and Logic Programming, Morgan Kaufmann Publishers, Los Altos, CA, 1988, 149–176.
Georgakopoulos,G., Kavvadias,D., Papadimitriou,C.H., Probabilistic satisfiability, Journal of Complexity 4:1, 1988, 1–11.
Gelfond,M., Lifschitz,V. The stable model semantics for logic programming. Logic Programming: Proc. 5th International Conference and Symposium, 1988.
van Gelder,A., Ross,K., Schlipf,J.S. Unfounded sets and wellfounded semantics for general logic programs. Proc 7th on Principles of Database Systems, 1988, 221–230
Nilsson,N.J. Probabilistic logic. Artificial Intelligence 18, 1 (1986), 71–87.
Newsletter of the Association for Logic Programming, v.4/1 (1991), pp.11–12.
Shapiro,E., Logic programs with uncertainties: a tool for implementing rulebased systems, Proc. 8th International Joint Conference on Artificial Intelligence, Karlsruhe, Germany, 1983, pp.529–532.
Sterling,L., Shapiro.E., The art of Prolog, 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dantsin, E. (1992). Probabilistic logic programs and their semantics. In: Voronkov, A. (eds) Logic Programming. Lecture Notes in Computer Science, vol 592. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55460-2_11
Download citation
DOI: https://doi.org/10.1007/3-540-55460-2_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55460-8
Online ISBN: 978-3-540-47083-0
eBook Packages: Springer Book Archive