Computing most probable worlds of action probabilistic logic programs: scalable estimation for 1030,000 worlds

  • Samir Khuller
  • M. Vanina Martinez
  • Dana Nau
  • Amy Sliva
  • Gerardo I. Simari
  • V. S. Subrahmanian
Article

Abstract

The semantics of probabilistic logic programs (PLPs) is usually given through a possible worlds semantics. We propose a variant of PLPs called action probabilistic logic programs or -programs that use a two-sorted alphabet to describe the conditions under which certain real-world entities take certain actions. In such applications, worlds correspond to sets of actions these entities might take. Thus, there is a need to find the most probable world (MPW) for -programs. In contrast, past work on PLPs has primarily focused on the problem of entailment. This paper quickly presents the syntax and semantics of -programs and then shows a naive algorithm to solve the MPW problem using the linear program formulation commonly used for PLPs. As such linear programs have an exponential number of variables, we present two important new algorithms, called \( \textsf{HOP} \) and \( \textsf{SemiHOP} \) to solve the MPW problem exactly. Both these algorithms can significantly reduce the number of variables in the linear programs. Subsequently, we present a “binary” algorithm that applies a binary search style heuristic in conjunction with the Naive, \( \textsf{HOP} \) and \( \textsf{SemiHOP} \) algorithms to quickly find worlds that may not be “most probable.” We experimentally evaluate these algorithms both for accuracy (how much worse is the solution found by these heuristics in comparison to the exact solution) and for scalability (how long does it take to compute). We show that the results of \( \textsf{SemiHOP} \) are very accurate and also very fast: more than 1030,000 worlds can be handled in a few minutes. Subsequently, we develop parallel versions of these algorithms and show that they provide further speedups.

Keywords

Uncertainty Probabilistic logic programs Most probable worlds Scalable approximations 

Mathematics Subject Classification (2000)

68T37 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bhattacharjee, Y.: Pentagon asks academics for help in understanding its enemies. Science 316(5824), 534–535 (2007)CrossRefGoogle Scholar
  2. 2.
    Damasio, C.V., Pereira, L.M., Swift, T.: Coherent well-founded annotated logic programs. In: Logic Programming and Non-monotonic Reasoning, pp. 262–276 (1999)Google Scholar
  3. 3.
    Dekhtyar, A., Subrahmanian, V.S.: Hybrid probabilistic programs. In: International Conference on Logic Programming, pp. 391–405 (1997)Google Scholar
  4. 4.
    Eiter, T., Lu, J.J., Subrahmanian, V.S.: Computing non-ground representations of stable models. In: Logic Programming and Non-monotonic Reasoning, pp. 198–217 (1997)Google Scholar
  5. 5.
    Eiter, T., Subrahmanian, V.S., Pick, G.: Heterogeneous active agents, i: semantics. Artif. Intell. 108(1–2), 178–255 (1999)MathSciNetGoogle Scholar
  6. 6.
    Fagin, R., Halpern, J.Y., Megiddo, N.: A logic for reasoning about probabilities. Inf. Comput. 87(1–2), 78–128 (1990)CrossRefMathSciNetGoogle Scholar
  7. 7.
    Hailperin, T.: Probability logic. Notre Dame J. Form. Log. 25(3), 198–212 (1984)MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Jaumard, B., Hansen, P., de Aragão, M.P.: Column generation methods for probabilistic logic. In: Proceedings of the First Integer Programming and Combinatorial Optimization Conference, pp. 313–331. University of Waterloo Press, Waterloo, Ontario, Canada (1990)Google Scholar
  9. 9.
    Lukasiewicz, T., Kern-Isberner, G.: Probabilistic logic programming under maximum entropy. In: Lecture Notes in Computer Science (Proceedings of ECSQARU 1999) 1638 (1999)Google Scholar
  10. 10.
    Lloyd, J.W.: Foundations of Logic Programming, 2nd edn. Springer-Verlag (1987)Google Scholar
  11. 11.
    Lakshmanan, L.V.S., Shiri, N.: A parametric approach to deductive databases with uncertainty. IEEE Trans. Knowl. Data Eng. 13(4), 554–570 (2001)CrossRefGoogle Scholar
  12. 12.
    Leone, N., Scarcello, F., Subrahmanian, V.S.: Optimal models of disjunctive logic programs: semantics, complexity, and computation. IEEE Trans. Knowl. Data Eng. 16(4), 487–503 (2004)CrossRefGoogle Scholar
  13. 13.
    Lukasiewicz, T.: Probabilistic logic programming. In: European Conference on Artificial Intelligence, pp. 388–392 (1998)Google Scholar
  14. 14.
    Ngo, L., Haddawy, P.: Probabilistic logic programming and bayesian networks. In: Asian Computing Science Conference, pp. 286–300 (1995)Google Scholar
  15. 15.
    Nilsson, N.: Probabilistic logic. Artif. Intell. 28, 71–87 (1986)MATHCrossRefMathSciNetGoogle Scholar
  16. 16.
    Ng, R.T., Subrahmanian, V.S.: A semantical framework for supporting subjective and conditional probabilities in deductive databases. In: Furukawa, K. (ed.) Proceedings of the Eighth International Conference on Logic Programming, pp. 565–580. The MIT Press (1991)Google Scholar
  17. 17.
    Ng, R.T., Subrahmanian, V.S.: Probabilistic logic programming. Inf. Comput. 101(2), 150–201 (1992)MATHCrossRefMathSciNetGoogle Scholar
  18. 18.
    Subrahmanian, V.S., Albanese, M., Martinez, V., Reforgiato, D., Simari, G.I., Sliva, A., Udrea, O., Wilkenfeld, J.: CARA: a cultural reasoning architecture. IEEE Intell. Syst. 22(2), 12–16 (2007)CrossRefGoogle Scholar
  19. 19.
    Stroe, B., Subrahmanian, V.S., Dasgupta, S.: Optimal status sets of heterogeneous agent programs. In: AAMAS ’05: Proceedings of the Fourth International Joint Conference on Autonomous Agents and Multiagent Systems, pp. 709–715. ACM, New York, NY, USA (2005)CrossRefGoogle Scholar
  20. 20.
    Subrahmanian, V.S.: Cultural modeling in real-time. Science 1507, 309–310 (2007)Google Scholar
  21. 21.
    van Emden, M.H.: Quantitative deduction and its fixpoint theory. J. Log. Program. 4, 37–53 (1986)CrossRefGoogle Scholar
  22. 22.
    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 (February 2007)Google Scholar

Copyright information

© Springer Science+Business Media B.V. 2008

Authors and Affiliations

  • Samir Khuller
    • 1
  • M. Vanina Martinez
    • 1
  • Dana Nau
    • 1
  • Amy Sliva
    • 1
  • Gerardo I. Simari
    • 1
  • V. S. Subrahmanian
    • 1
  1. 1.Department of Computer Science and University of Maryland Institute for Advanced Computer Studies (UMIACS)University of Maryland College ParkCollege ParkUSA

Personalised recommendations