On the Relationship between Logical Bayesian Networks and Probabilistic Logic Programming Based on the Distribution Semantics

  • Daan Fierens
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5989)


A significant part of current research on (inductive) logic programming deals with probabilistic logical models. Over the last decade many logics or languages for representing such models have been introduced. There is currently a great need for insight into the relationships between all these languages. One kind of languages are those that extend probabilistic models with elements of logic, such as the language of Logical Bayesian Networks (LBNs). Some other languages follow the converse strategy of extending logic programs with a probabilistic semantics, often in a way similar to that of Sato’s distribution semantics.

In this paper we study the relationship between the language of LBNs and languages based on the distribution semantics. Concretely, we define a mapping from LBNs to theories in the Independent Choice Logic (ICL). We also show how this mapping can be used to learn ICL theories from data.


probabilistic (inductive) logic programming Bayesian networks 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Carbonetto, P., Kisynski, J., Chiang, M., Poole, D.: Learning a contingently acyclic, probabilistic relational model of a social network. Technical Report TR-2009-08, Department of Computer Science, University of British Columbia (2009)Google Scholar
  2. 2.
    De Raedt, L., Demoen, B., Fierens, D., Gutmann, B., Janssens, G., Kimmig, A., Landwehr, N., Mantadelis, T., Meert, W., Rocha, R., Santos Costa, V., Thon, I., Vennekens, J.: Towards digesting the alphabet-soup of statistical relational learning. In: NIPS Workshop on Probabilistic Programming (2008)Google Scholar
  3. 3.
    De Raedt, L., Frasconi, P., Kersting, K., Muggleton, S.H. (eds.): Probabilistic Inductive Logic Programming. LNCS (LNAI), vol. 4911, pp. 1–27. Springer, Heidelberg (2008)zbMATHGoogle Scholar
  4. 4.
    Fierens, D.: Logical Bayesian networks. Chapter 3 of Learning Directed Probabilistic Logical Models from Relational Data. PhD Thesis, Katholieke Universiteit Leuven (2008),
  5. 5.
    Fierens, D., Ramon, J., Bruynooghe, M., Blockeel, H.: Learning directed probabilistic logical models: Ordering-search versus structure-search. Annals of Mathematics and Artificial Intelligence 54(1-3), 99–133 (2008)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Fierens, D.: Mapping logical Bayesian networks to probabilistic logic programs with distribution semantics. Technical Report CW 563, Department of Computer Science, Katholieke Universiteit Leuven (2009),
  7. 7.
    Friedman, N., Goldszmidt, M.: Learning Bayesian networks with local structure. In: Learning and Inference in Graphical Models, pp. 421–459. MIT Press, Cambridge (1999)Google Scholar
  8. 8.
    Getoor, L., Taskar, B.: An Introduction to Statistical Relational Learning. MIT Press, Cambridge (2007)Google Scholar
  9. 9.
    Gutmann, B., Kimmig, A., Kersting, K., De Raedt, L.: Parameter learning in probabilistic databases: A least squares approach. In: Daelemans, W., Goethals, B., Morik, K. (eds.) ECML PKDD 2008, Part I. LNCS (LNAI), vol. 5211, pp. 473–488. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  10. 10.
    Meert, W., Struyf, J., Blockeel, H.: Learning ground CP-logic theories by leveraging Bayesian network learning techniques. Fundamenta Informaticae 89(1), 131–160 (2008)zbMATHMathSciNetGoogle Scholar
  11. 11.
    Pelov, N., Denecker, M., Bruynooghe, M.: Well-founded and stable semantics of logic programs with aggregates. Theory and Practice of Logic Programming 7(3), 301–353 (2007)zbMATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Poole, D.: Abducing through negation as failure: Stable models within the independent choice logic. Journal of Logic Programming 44(1-3), 5–35 (2000)zbMATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    Sato, T.: A statistical learning method for logic programs with distribution semantics. In: Proceedings of the 12th International Conference on Logic Programming, pp. 715–729. MIT Press, Cambridge (1995)Google Scholar
  14. 14.
    Vennekens, J., Verbaeten, S., Bruynooghe, M.: Logic programs with annotated disjunctions. In: Demoen, B., Lifschitz, V. (eds.) ICLP 2004. LNCS, vol. 3132, pp. 431–445. Springer, Heidelberg (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Daan Fierens
    • 1
  1. 1.Department of Computer ScienceKatholieke Universiteit LeuvenHeverleeBelgium

Personalised recommendations