Abstract
Logic Programs with Annotated Disjunctions (LPADs) provide a simple and elegant framework for integrating probabilistic reasoning and logic programming. In this paper we propose an algorithm for learning LPADs. The learning problem we consider consists in starting from a sets of interpretations annotated with their probability and finding one (or more) LPAD that assign to each interpretation the associated probability. The learning algorithm first finds all the disjunctive clauses that are true in all interpretations, then it assigns to each disjunct in the head a probability and finally decides how to combine the clauses to form an LPAD by solving a constraint satisfaction problem. We show that the learning algorithm is correct and complete.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Blockeel ,H.:Prolog for first-order bayesian networks: A meta-intepreter approach. In: Multi-Relational Data Mining, MRDM03 (2003)
Clark, K.L.: Negation as failure. In: Logic and Databases, Plenum Press, New York (1978)
Cussens, J.: Stochastic logic programs: Sampling, inference and applications. In: Sixteenth Annual Conference on Uncertainty in Artificial Intelligence (UAI 2000), pp. 115–122. Morgan Kaufmann, San Francisco (2000)
De Raedt, L., Dehaspe, L.: Clausal discovery. Machine Learning 26(2–3), 99–146 (1997)
Fitting, M.: A kripke-kleene semantics for logic programs. Journal of Logic Programming 2(4), 295–312 (1985)
Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Kowalski, R., Bowen, K.A. (eds.) Proceedings of the 5th Int. Conf. on Logic Programming, pp. 1070–1080. MIT Press, Cambridge (1988)
Getoor, L., Friedman, N., Koller, D., Pfeffer, A.: Learning probabilistic relational models. In: Dzeroski, S., Lavrac, N. (eds.) Relational Data Mining, Springer, Berlin (2001)
Holzbaur, C.: OFAI clp(q,r) manual, edition 1.3.3. Technical Report TR-95-09, Austrian Research Institute for Artificial Intelligence, Vienna (1995)
Kersting, K., De Raedt, L.: Bayesian logic programs. In: Work-in-Progress Reports of the Tenth International Conference on Inductive Logic Programming (ILP2000), London, UK (2000)
Kersting, K., De Raedt, L.: Bayesian logic programs. Technical Report 151, Institute for Computer Science, University of Freiburg, Freiburg, Germany (April 2001)
Kersting, K., De Raedt, L.: Towards combining inductive logic programming and bayesian networks. In: Rouveirol, C., Sebag, M. (eds.) ILP 2001. LNCS (LNAI), vol. 2157, p. 118. Springer, Heidelberg (2001)
Lobo, J., Minker, J., Rajasekar, A.: Foundations of Disjunctive Logic Programming. MIT Press, Cambridge (1992)
Muggleton, S.H.: Learning stochastic logic programs. Electronic Transactions in Artificial Intelligence 4(041) (2000)
Ng, R.T., Subrahmanian, V.S.: Probabilistic logic programming. Information and Computation 101(2), 150–201 (1992)
Ngo, L., Haddaway, P.: Answering queries from context-sensitive probabilistic knowledge bases. Theoretical Computer Science 171(1–2), 147–177 (1997)
Ngo Probabilistic, L.: disjunctive logic programming. In: Proceedings of the 12th Annual Conference on Uncertainty in Artificial Intelligence (UAI 1996), pp. 397–404. Morgan Kaufmann Publishers, San Francisco (1996)
Poole, D.: The Independent Choice Logic for modelling multiple agents under uncertainty. Artificial Intelligence 94(1–2), 7–56 (1997)
Santos Costa, V., Page, D., Qazi, M., Cussens, J.: Clp(BN): Constraint logic programming for probabilistic knowledge. In:Uncertainty in Artificial Intelligence, UAI 2003 (2003)
Sato, T.: A statistical learning method for logic programs with distribution semantics. In: 12th International Conference on Logic Programming (ICLP 1995), pp. 715–729 (1995)
Van Gelder, K.A.: Ross, and J. S. Schlipf. The well-founded semantics for general logic programs. Journal of the ACM 38(3), 620–650 (1991)
Vennekens, J., Verbaeten, S.: Logic programs with annotated disjunctions. Technical Report CW386, K. U. Leuven (2003), http://www.cs.kuleuven.ac.be/~joost/techrep.ps
Vennekens, J., Verbaeten, S., Bruynooghe, M.: Logic programs with annotated disjunctions. In: The 20th International Conference on Logic Programming, ICLP 2004 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Riguzzi, F. (2004). Learning Logic Programs with Annotated Disjunctions. In: Camacho, R., King, R., Srinivasan, A. (eds) Inductive Logic Programming. ILP 2004. Lecture Notes in Computer Science(), vol 3194. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30109-7_21
Download citation
DOI: https://doi.org/10.1007/978-3-540-30109-7_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22941-4
Online ISBN: 978-3-540-30109-7
eBook Packages: Springer Book Archive