Abstract
We give a logic programming based account of probability and describe a declarative language P-log capable of reasoning which combines both logical and probabilistic arguments. Several non-trivial examples illustrate the use of P-log for knowledge representation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bacchus, F.: Representing and reasoning with uncertain knowledge. MIT Press, Cambridge (1990)
Balduccini, M., Gelfond, M.: Logic Programs with Consistency-Restoring Rules. In: AAAI Spring 2003 Symposium (2003)
Eiter, T., Faber, W., Leone, N., Pfeifer, G.: Declarative problem solving in dlv. In: Minker, J. (ed.) Logic Based Artificial Intelligence, pp. 79–103. Kluwer Academic Publishers, Dordrecht (2000)
Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Generation Computing, 365–387 (1991)
Getoor, L., Friedman, N., Koller, D., Pfeffer, A.: Learning probabilistic relational models. In: Relational data mining, pp. 307–335. Springer, Heidelberg (2001)
Iwan, G., Lakemeyer, G.: What observations really tell us. In: CogRob 2002 (2002)
Kersting, K., De Raedt, L.: Bayesian logic programs. In: Cussens, J., Frisch, A. (eds.) Proceedings of the Work-in-Progress Track at the 10th International Conference on Inductive Logic Programming, pp. 138–155 (2000)
Lukasiewicz, T.: Probabilistic logic programming. In: ECAI, pp. 388–392 (1998)
Muggleton, S.: Stochastic logic programs. In: De Raedt, L. (ed.) Proceedings of the 5th International Workshop on Inductive Logic Programming, Department of Computer Science, Katholieke Universiteit Leuven, p. 29 (1995)
Ng, R.T., Subrahmanian, V.S.: Probabilistic logic programming. Information and Computation 101(2), 150–201 (1992)
Ngo, L., Haddawy, P.: Answering queries from context-sensitive probabilistic knowledge bases. Theoretical Computer Science 171(1-2), 147–177 (1997)
Niemelä, I., Simons, P.: Smodels – an implementation of the stable model and well-founded semantics for normal logic programs. In: Dix, J., Furbach, U., Nerode, A. (eds.) Proc. 4th international conference on Logic programming and non-monotonic reasoning, pp. 420–429. Springer, Heidelberg (1997)
Simons, P., Niemelä, I., Soininen, T.: Extending and implementing the stable model semantics. Artificial Intelligence Journal 138, 181–234 (2002)
Pearl, J.: Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann Publishers, San Francisco (1988)
Pearl, J.: Causality. Cambridge University Press, Cambridge (2000)
D. Poole. The independent choice logic for modeling multiple agents under uncertainty. Artificial Intelligence, 94(1-2 (special issue on economic principles of multi-agent systems)):7–56, 1997.
Poole, D.: Abducing through negation as failure: Stable models within the independent choice logic. Journal of Logic Programming 44, 5–35 (2000)
Poole, D.: Probabilistic horn abduction and Bayesian networks. Artificial Intelligence 64(1), 81–129 (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baral, C., Gelfond, M., Rushton, N. (2003). Probabilistic Reasoning With Answer Sets. In: Lifschitz, V., Niemelä, I. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 2004. Lecture Notes in Computer Science(), vol 2923. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24609-1_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-24609-1_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20721-4
Online ISBN: 978-3-540-24609-1
eBook Packages: Springer Book Archive