Skip to main content
Springer Nature Link
Log in

Towards a More Practical Hybrid Probabilistic Logic Programming Framework

  • Conference paper
Practical Aspects of Declarative Languages (PADL 2005)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 3350))

Included in the following conference series:

  • 373 Accesses

Abstract

The hybrid probabilistic programs framework [1] allows the user to explicitly encode both logical and statistical knowledge available about the dependency among the events in the program. In this paper, we extend the language of hybrid probabilistic programs by allowing disjunctive composition functions to be associated with heads of clauses, and we modify its semantics to make it more suitable to encode real-world applications. The new semantics is a natural extension of standard logic programming semantics. The new semantics of hybrid probabilistic programs also subsumes the implication-based probabilistic approach proposed by Lakshmanan and Sadri [12]. We provide also a sound and complete algorithm to compute the least fixpoint of hybrid probabilistic programs with annotated atomic formulas as rule heads.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Dekhtyar, A., Subrahmanian, V.S.: Hybrid Probabilistic Program. Journal of Logic Programming 43(3), 187–250 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  2. Dekhtyar, M., Dekhtyar, A., Subrahmanian, V.S.: Hybrid Probabilistic Programs: Algorithms and Complexity. In: Proc. of UAI Conference, pp. 160–169 (1999)

    Google Scholar 

  3. Dowling, W.F., Gallier, J.H.: Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae. Journal of Logic Programming 3, 267–284 (1984)

    Article  MathSciNet  Google Scholar 

  4. Dubois, D., et al.: Towards Possibilistic Logic Programming. In: ICLP. MIT Press, Cambridge (1991)

    Google Scholar 

  5. Fitting, M.C.: Logic Programming on A Topological Bilattice. Fundamenta Informaticae 11, 209–218 (1988)

    MATH  MathSciNet  Google Scholar 

  6. Fitting, M.C.: Bilattices and The Semantics of Logic Programming. Journal of Logic Programming 11, 91–116 (1991)

    Google Scholar 

  7. Kersting, K., De Raedt, L.: Bayesian Logic Programs. Inductive LP (2000)

    Google Scholar 

  8. Kifer, M., Li, A.: On The Semantics of Rule-Based Expert Systems with Uncertainty. In: Intl. Conf. on Database Theory. Springer, Heidelberg (1988)

    Google Scholar 

  9. Kifer, M., Subrahmanian, V.S.: Theory of Generalized Annotated Logic Programming and Its Applications. Journal of Logic Programming 12, 335–367 (1992)

    Article  MathSciNet  Google Scholar 

  10. Kushmerick, N., Hanks, S., Weld, D.: An Algorithm for Probabilistic Planning. Artificial Intelligence 76(1-2), 239–286 (1995)

    Article  Google Scholar 

  11. Lakshmanan, V.S.L., Sadri, F.: Modeling Uncertainty in Deductive Databases. In: Conf. on Database Expert Systems and Applications. Springer, Heidelberg (1994)

    Google Scholar 

  12. Lakshmanan, V.S.L., Sadri, F.: Probabilistic Deductive Databases. In: Intl. Logic Programming Symposium. MIT Press, Cambridge (1994)

    Google Scholar 

  13. Lakshmanan, V.S.L., Sadri, F.: Uncertain Deductive Databases: A Hybrid Approach. Information Systems 22(8), 483–508 (1997)

    Article  MATH  Google Scholar 

  14. Lakshmanan, V.S.L., Shiri, N.: A Parametric Approach to Deductive Databases with Uncertainty. IEEE TKDE 13(4), 554–570 (2001)

    Google Scholar 

  15. Leach, S.M., Lu, J.J.: Query Processing in Annotated Logic Programming. Journal of Intelligent Information Systems 6(1), 33–58 (1996)

    Article  Google Scholar 

  16. Loyer, Y., Straccia, U.: The Approximate Well-founded Semantics for Logic Programs with Uncertainty. In: Rovan, B., Vojtáš, P. (eds.) MFCS 2003. LNCS, vol. 2747, pp. 541–550. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  17. Lu, J.J., et al.: Computing Annotated Logic Programs. In: ICLP. MIT Press, Cambridge (1994)

    Google Scholar 

  18. Ng, R.T., Subrahmanian, V.S.: Probabilistic Logic Programming. Information and Computation 101(2), 150–201 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  19. Ng, R.T., Subrahmanian, V.S.: A Semantical Framework for Supporting Subjective and Conditional Probabilities in Deductive DBs. J. Automated Reasoning 10(2) (1993)

    Google Scholar 

  20. Ng, R.T., Subrahmanian, V.S.: Stable Semantics for Probabilistic Deductive Databases. Information and Computation 110(1), 42–83 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  21. Sato, T., Kameya, Y.: PRISM: Language for Symbolic-Statistical Modeling. In: IJCAI (1997)

    Google Scholar 

  22. Shapiro, E.: Logic Programs with Uncertainties: A Tool for Implementing Expert Systems. In: Proc. of IJCAI, pp. 529–532 (1983)

    Google Scholar 

  23. Subrahmanian, V.S.: On The Semantics of Quantitative Logic Programs. In: Symp. on Logic Programming, pp. 173–182. IEEE Computer Society, Los Alamitos (1987)

    Google Scholar 

  24. van Emden, M.H.: Quantitative Deduction and Its Fixpoint Theory. Journal of Logic Programming 4(1), 37–53 (1986)

    Article  Google Scholar 

  25. Vennekens, J., Verbaeten, S.: A General View on Probabilistic Logic Programming. In: Belgian-Dutch Conference on AI (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, New Mexico State University,  

    Emad Saad & Enrico Pontelli

Authors
  1. Emad Saad
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Enrico Pontelli
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. IMDEA Institute for Software Development Technology, Universidad Politécnica de Madrid, University of New Mexico Universidad Complutense de Madrid,  

    Manuel V. Hermenegildo

  2. School of Computer Science, T.U. Madrid (UPM), Spain

    Daniel Cabeza

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Saad, E., Pontelli, E. (2005). Towards a More Practical Hybrid Probabilistic Logic Programming Framework. In: Hermenegildo, M.V., Cabeza, D. (eds) Practical Aspects of Declarative Languages. PADL 2005. Lecture Notes in Computer Science, vol 3350. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30557-6_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30557-6_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24362-5

  • Online ISBN: 978-3-540-30557-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics