Finding Most Probable Worlds of Probabilistic Logic Programs

  • Samir Khuller
  • Vanina Martinez
  • Dana Nau
  • Gerardo Simari
  • Amy Sliva
  • V. S. Subrahmanian
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4772)


Probabilistic logic programs have primarily studied the problem of entailment of probabilistic atoms. However, there are some interesting applications where we are interested in finding a possible world that is most probable. Our first result shows that the problem of computing such ”maximally probable worlds” (MPW) is intractable. We subsequently show that we can often greatly reduce the size of the linear program used in past work (by Ng and Subrahmanian) and yet solve the problem exactly. However, the intractability results still make computational efficiency quite impossible. We therefore also develop several heuristics to solve the MPW problem and report extensive experimental results on the accuracy and efficiency of such heuristics.


Equivalence Class Probabilistic Logic Ground Atom Ground Instance Deductive Database 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Ng, R.T., Subrahmanian, V.S.: Probabilistic logic programming. Information and Computation 101(2), 150–201 (1992)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Hailperin, T.: Probability logic. Notre Dame Journal of Formal Logic 25 (3), 198–212 (1984)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Fagin, R., Halpern, J.Y., Megiddo, N.: A logic for reasoning about probabilities. Information and Computation 87(1/2), 78–128 (1990)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Nilsson, N.: Probabilistic logic. Artificial Intelligence 28, 71–87 (1986)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Ng, R.T., Subrahmanian, V.S.: A semantical framework for supporting subjective and conditional probabilities in deductive databases. In: Furukawa, K. (ed.) Proc. of the 8th Int. Conf. on Logic Programming, pp. 565–580. The MIT Press, Cambridge (1991)Google Scholar
  6. 6.
    Subrahmanian, V., Albanese, M., Martinez, V., Reforgiato, D., Simari, G.I., Sliva, A., Udrea, O., Wilkenfeld, J.: CARA: A Cultural Adversarial Reasoning Architecture. IEEE Intelligent Systems 22(2), 12–16 (2007)CrossRefGoogle Scholar
  7. 7.
    Lloyd, J.W.: Foundations of Logic Programming, 2nd edn. Springer, Heidelberg (1987)zbMATHGoogle Scholar
  8. 8.
    Wilkenfeld, J., Asal, V., Johnson, C., Pate, A., Michael, M.: The use of violence by ethnopolitical organizations in the middle east. Technical report, National Consortium for the Study of Terrorism and Responses to Terrorism (2007)Google Scholar
  9. 9.
    Ernst, J., Martinez, V., Simari, G.I., Sliva, A.: Mining rules about behaviors of terror groups. In preparation for submission to a conference (2007)Google Scholar
  10. 10.
    Ngo, L., Haddawy, P.: Probabilistic logic programming and bayesian networks. In: Asian Computing Science Conf., pp. 286–300 (1995)Google Scholar
  11. 11.
    Lukasiewicz, T., Kern-Isberner, G.: Probabilistic logic programming under maximum entropy. In: Hunter, A., Parsons, S. (eds.) ECSQARU 1999. LNCS (LNAI), vol. 1638, Springer, Heidelberg (1999)CrossRefGoogle Scholar
  12. 12.
    Lakshmanan, L.V.S., Shiri, N.: A parametric approach to deductive databases with uncertainty. IEEE Trans. on Knowledge and Data Engineering 13(4), 554–570 (2001)CrossRefGoogle Scholar
  13. 13.
    Dekhtyar, A., Subrahmanian, V.S.: Hybrid probabilistic programs. In: Int. Conf. on Logic Programming, pp. 391–405 (1997)Google Scholar
  14. 14.
    van Emden, M.: Quantitative deduction and its fixpoint theory. Journal of Logic Programming 4, 37–53 (1986)CrossRefGoogle Scholar
  15. 15.
    Lukasiewicz, T.: Probabilistic logic programming. In: European Conference on Artificial Intelligence, pp. 388–392 (1998)Google Scholar
  16. 16.
    Pillo, A.: Implementation and investigation of probabilistic reasoning in deductive databases. Diploma Thesis, University of Wuerzburg (1998)Google Scholar
  17. 17.
    Seipel, D., Thöne, H.: DISLOG - A system for reasoning in disjunctive deductive databases. In: DAISD 1994, pp. 325–343 (1994)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Samir Khuller
    • 1
  • Vanina Martinez
    • 1
  • Dana Nau
    • 1
  • Gerardo Simari
    • 1
  • Amy Sliva
    • 1
  • V. S. Subrahmanian
    • 1
  1. 1.University of Maryland College Park, College Park, MD 20742USA

Personalised recommendations