Deriving a Stationary Dynamic Bayesian Network from a Logic Program with Recursive Loops

  • Yi-Dong Shen
  • Qiang Yang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3625)


Recursive loops in a logic program present a challenging problem to the PLP framework. On the one hand, they loop forever so that the PLP backward-chaining inferences would never stop. On the other hand, they generate cyclic influences, which are disallowed in Bayesian networks. Therefore, in existing PLP approaches logic programs with recursive loops are considered to be problematic and thus are excluded. In this paper, we propose an approach that makes use of recursive loops to build a stationary dynamic Bayesian network. Our work stems from an observation that recursive loops in a logic program imply a time sequence and thus can be used to model a stationary dynamic Bayesian network without using explicit time parameters. We introduce a Bayesian knowledge base with logic clauses of the form AA 1,...,A l , true, Context, Types, which naturally represents the knowledge that the A i s have direct influences on A in the context Context under the type constraints Types. We then use the well-founded model of a logic program to define the direct influence relation and apply SLG-resolution to compute the space of random variables together with their parental connections. We introduce a novel notion of influence clauses, based on which a declarative semantics for a Bayesian knowledge base is established and algorithms for building a two-slice dynamic Bayesian network from a logic program are developed.


Probabilistic logic programming (PLP) the well-founded semantics SLG-resolution stationary dynamic Bayesian networks 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Apt, K.R., Bezem, M.: Acyclic programs. New Generation Computing 29(3), 335–363 (1991)CrossRefGoogle Scholar
  2. 2.
    Bacchus, F.: Using first-order probability logic for the construction of Bayesian networks. In: Proc. of the Ninth Conference on Uncertainty in Artificial Intelligence, pp. 219–226 (1994)Google Scholar
  3. 3.
    Breese, J.S.: Construction of belief and decision networks. Computational Intelligence 8(4), 624–647 (1992)CrossRefGoogle Scholar
  4. 4.
    Chen, W.D., Swift, T., Warren, D.S.: Efficient top-down computation of queries under the well-founded semantics. Journal of Logic Programming 24(3), 161–199 (1995)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Cussens, J.: Stochastic logic programs: sampling, inference and applications. In: Proc. of The Sixteenth Annual Conference on Uncertainty in Artificail Intelligence, pp. 115–122 (2000)Google Scholar
  6. 6.
    De Raedt, L., Kersting, K.: Probabilistic logic learning. SIGKDD Explorations 5(1), 31–48 (2003)CrossRefGoogle Scholar
  7. 7.
    Domingos, P., Richardson, M.: Markov logic: a unifying framework for statistical relational learning. In: Proc. of the ICML 2004 Workshop on Statistical Relational Learning and its Connections to Other Fields, Banff, Canada, pp. 49–54 (2004)Google Scholar
  8. 8.
    Fabian, I., Lambert, D.A.: First-order Bayesian reasoning. In: Antoniou, G., Slaney, J.K. (eds.) Canadian AI 1998. LNCS (LNAI), vol. 1502, pp. 131–142. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  9. 9.
    Fierens, D., Blockeel, H., Ramon, J., Bruynooghe, M.: Logical Bayesian networks. In: 3rd Workshop on Multi-Relational Data Mining, Seattle, USA (2005)Google Scholar
  10. 10.
    Getoor, L.: Learning Statistical Models from Relational Data, Ph.D. thesis, Stanford University (2001)Google Scholar
  11. 11.
    Glesner, S., Koller, D.: Constructing flexible dynamic belief networks from first-order probabilistic knowledge bases. In: Froidevaux, C., Kohlas, J. (eds.) Proceedings of the European Conference on Symbolic and Quantitative Approaches to Reasoning under Uncertainty, Fribourg, Switzerland, July 1995, pp. 217–226 (1995)Google Scholar
  12. 12.
    Goldman, R., Charniak, E.: A language for construction of belief networks. IEEE Transactions on Pattern Analysis and Machine Intelligence 15(3), 196–208 (1993)CrossRefGoogle Scholar
  13. 13.
    Jaeger, M.: Relational Bayesian networks. In: Proc. of The Thirteenth Annual Conference on Uncertainty in Artificail Intelligence, pp. 266–273 (1997)Google Scholar
  14. 14.
    Kanazawa, K., Koller, D., Russell, S.: Stochastic simulation algorithms for dynamic probabilistic networks. In: Proc. of the Eleventh Annual Conference on Uncertainty in Artificail Intelligence (1995)Google Scholar
  15. 15.
    Kersting, K., De Raedt, L.: Bayesian logic programs. In: Cussens, J., Frisch, A. (eds.) Work-in-Progress Reports of the Tenth International Conference on Inductive Logic Programming, London,U.K (2000) (A full version: Technical Report 151, University of Freiburg Institute for Computer Science)Google Scholar
  16. 16.
    Lloyd, J.W.: Foundations of Logic Programming, 2nd edn. Springer, Berlin (1987)zbMATHGoogle Scholar
  17. 17.
    Muggleton, S.: Stochastic logic programs. In: Advances in Inductive Logic Programming. IOS Press, Amsterdam (1996)Google Scholar
  18. 18.
    Ngo, L., Haddawy, P.: Answering queries from context-sensitive probabilistic knowledge bases. Theoretical Computer Science 171, 147–177 (1997)zbMATHCrossRefMathSciNetGoogle Scholar
  19. 19.
    Pearl, J.: Probabilistic Resoning in Intelligent Systems: Networks of Plausible inference. Morgan Kaufmann, San Francisco (1988)Google Scholar
  20. 20.
    Pfeffer, A., Koller, D.: Semantics and inference for recursive probability models. In: Proc. of the Seventeenth National Conference on Artificial Intelligence, pp. 538–544. AAAI Press, Menlo Park (2000)Google Scholar
  21. 21.
    Poole, D.: Probabilistic Horn abduction and Bayesian networks. Artificial Intelligence 64(1), 81–129 (1993)zbMATHCrossRefGoogle Scholar
  22. 22.
    Russell, S., Norvig, P.: Artificial Intelligence: A Modern Approach. Prentice-Hall, Englewood Cliffs (1995)zbMATHGoogle Scholar
  23. 23.
    Sagonas, K., Swift, T., Warren, D.S., Freire, J., Rao, P.: The XSB Programmer’s Manual (Version 1.8). Department of Computer Science, SUNY at Stony Brook, Available from
  24. 24.
    Sato, T., Kameya, Y.: Parameter learning of logic programs for symbolic-statistical modeling. Journal of Artificial Intelligence Research 15, 391–454 (2001)zbMATHMathSciNetGoogle Scholar
  25. 25.
    Shen, Y.D., You, J.H., Yuan, L.Y.: Enhancing global SLS-resolution with loop cutting and tabling mechanisms. Theoretical Computer Science 328(3), 271–287 (2004)zbMATHCrossRefMathSciNetGoogle Scholar
  26. 26.
    Taskar, B., Abeel, P., Koller, D.: Discriminative probabilistic models for relational data. In: Proc. of the Eighteenth Conf. on Uncertainty in Artificial Intelligence, Edmonton, Canada, pp. 485–492 (2002)Google Scholar
  27. 27.
    Ullman, J.D.: Database and Knowledge-Base Systems, vol. I and II. Computer Science Press, Rockville (1988)Google Scholar
  28. 28.
    Van Gelder, A.: Negation as failure using tight derivations for general logic programs. Journal of Logic Programming 6(1&2), 109–133 (1989)zbMATHCrossRefMathSciNetGoogle Scholar
  29. 29.
    Van Gelder, A., Ross, K., Schlipf, J.: The well-founded semantics for general logic programs. J. ACM 38(3), 620–650 (1991)zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Yi-Dong Shen
    • 1
  • Qiang Yang
    • 2
  1. 1.Laboratory of Computer Science, Institute of SoftwareChinese Academy of SciencesBeijingChina
  2. 2.Department of Computing ScienceHong Kong University of Science and TechnologyHong KongChina

Personalised recommendations