Skip to main content
SpringerLink
Log in

A new approach to hybrid probabilistic logic programs

  • Published:
Annals of Mathematics and Artificial Intelligence Aims and scope Submit manuscript

An Erratum to this article was published on 10 August 2007

Abstract

This paper presents a novel revision of the framework of Hybrid Probabilistic Logic Programming, along with a complete semantics characterization, to enable the encoding of and reasoning about real-world applications. The language of Hybrid Probabilistic Logic Programs framework is extended to allow the use of non-monotonic negation, and two alternative semantical characterizations are defined: stable probabilistic model semantics and probabilistic well-founded semantics. These semantics generalize the stable model semantics and well-founded semantics of traditional normal logic programs, and they reduce to the semantics of Hybrid Probabilistic Logic programs for programs without negation. It is the first time that two different semantics for Hybrid Probabilistic Programs with non-monotonic negation as well as their relationships are described. This proposal provides the foundational grounds for developing computational methods for implementing the proposed semantics. Furthermore, it makes it clearer how to characterize non-monotonic negation in probabilistic logic programming frameworks for commonsense reasoning.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Apt, K.R., Bol, R.N.: Logic programming and negation: a survey. J. Log. Program. 19/20, 9–71 (1994)

    Article  Google Scholar 

  2. Baral, C., et al.: Probabilistic reasoning with snswer sets. In: Logic Programming and Non-monotonic Reasoning. Springer, Berlin Heidelberg New York (2004)

    Google Scholar 

  3. Damasio, C.V., Pereira, L.M.: Hybrid probabilistic logic programs as residuated logic programs. In: JELIA. Springer, Berlin Heidelberg New York (2000)

    Google Scholar 

  4. Damasio, C.V., et al.: Coherent Well-founded Annotated Logic Programs. Logic Programming and Non-monotonic Reasoning. Springer, Berlin Heidelberg New York (1999)

    Google Scholar 

  5. Dekhtyar, A., Subrahmanian, V.S.: Hybrid probabilistic program. In J. Log. Program. 43(3), 187–250 (2000)

    Article  MATH  Google Scholar 

  6. Dowling, W.F., Gallier, J.H.: Linear-time algorithms for testing the satisfiability of propositional Horn formulae. J. Log. Program. 1(3), 267–284 (1984)

    Article  Google Scholar 

  7. Dubois, D., et al.: Towards possibilistic logic programming. In: Proceedings of the International Conference on Logic Programming. MIT Press (1991)

  8. Fitting, M.C.: Logic programming on a topological bilattice. Fundam. Inform. 11, 209–218 (1988)

    MATH  Google Scholar 

  9. Fitting, M.C.: Bilattices and the semantics of logic programming. J. Log. Program. 11, 91–16 (1991)

    Article  MATH  Google Scholar 

  10. Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Proceedings of the International Conference and Symposium on Logic Programming. MIT Press, Cambridge (1988)

    Google Scholar 

  11. Van Gelder, A.: The alternating fixpoint of logic programs with negation. J. Comput. Syst. Sci. 47(1), 185–221 (1993)

    Article  MATH  Google Scholar 

  12. Van Gelder, A., Ross, K.A., Schlipf, J.S.: The well-founded semantics for general logic programs. J. ACM 38(3), 620–650 (1991)

    Article  MATH  Google Scholar 

  13. Giunchiglia, E., Lierler, Y., Maratea, M.: SAT-based answer set programming. In AAAI (2004)

  14. Grätzer, G.: General Lattice Theory. Birkhäuser Verlag Basel und Stuttgart (1978)

  15. Kersting, K., De Raedt, L.: Bayesian logic programs. In: Proceedings of the International Conference on Inductive Logic Programming. Springer, Berlin Heidelberg New York (2000)

    Google Scholar 

  16. Kifer, M., Li, A.: On the semantics of rule-based expert systems with uncertainty. In: Intl. Conf. on Database Theory. Springer, Berlin Heidelberg New York (1988)

    Google Scholar 

  17. Kifer, M., Subrahmanian, V.S.: Theory of generalized annotated logic programming and its applications. J. Log. Program. 12, 335–367 (1992)

    Article  Google Scholar 

  18. Kushmerick, N., Hanks, S., Weld, D.: An algorithm for probabilistic planning. Artif. Intell. 76(1,2), 239–286 (1995)

    Article  Google Scholar 

  19. Lakshmanan, V.S.L., Sadri, F.: Modeling uncertainty in deductive databases. In: Proceedings of the Conf. on Database Expert Systems and Applications. Springer, Berlin Heidelberg New York (1994)

    Google Scholar 

  20. Lakshmanan, V.S.L., Sadri, F.: Uncertain deductive databases: a hybrid approach. Inf. Syst. 22(8), 483–508 (1997)

    Article  MATH  Google Scholar 

  21. Lakshmanan, L.V.S., Sadri, F.: On a theory of probabilistic deductive databases. Theory Pract. Log. Program. 1(1), 5–42 (2001)

    Article  Google Scholar 

  22. Lakshmanan, L.V.S., Shiri, N.: A parametric approach to deductive databases with uncertainty. IEEE TKDE 13(4), 554–570 (2001)

    Google Scholar 

  23. Leach, S.M., Lu, J.J.: Query processing in annotated logic programming. J. Intell. Inf. Syst. 6(1), 33–58 (1996)

    Article  Google Scholar 

  24. Lloyd, J.W.: Foundations of Logic Programming. Springer, Berlin Heidelberg New York (1987)

    MATH  Google Scholar 

  25. Loyer, Y., Straccia, U.: The well-founded semantics in normal logic programs with uncertainty. In: Proceedings of FLOPS. Springer, Berlin Heidelberg New York (2002)

    Google Scholar 

  26. Loyer, Y., Straccia, U.: The approximate well-founded semantics for logic programs with uncertainty. In: Proceedings of the International Symposium on Mathematical Foundations of Computer Science. Springer, Berlin Heidelberg New York (2003)

    Google Scholar 

  27. Lu, J.J., et al.: Computing annotated logic programs. In: Proceedings of the International Conference on Logic Programming. MIT Press, Cambridge (1994)

    Google Scholar 

  28. Lukasiewicz, T.: Probabilistic logic programming. In: Proceedings of the European Conference on Artificial Intelligence, 388–392. Morgan Kaufmann, San Mateo, CA (1998)

    Google Scholar 

  29. Lukasiewicz, T.: Many-valued disjunctive logic programs with probabilistic semantics. In: Logic Programming and Non-monotonic Reasoning. Springer, Berlin Heidelberg New York (1999)

    Google Scholar 

  30. Niemela, I., Simons, P.: Efficient implementation of the well-founded and stable model semantics. In: Joint International Conference and Symposium on Logic Programming, pp. 289–303. MIT Press, San Mateo, CA (1996)

    Google Scholar 

  31. Ng, R.T., Subrahmanian, V.S.: Probabilistic logic programming. Inf. Comput. 101(2), (1992)

  32. Ng, R.T., Subrahmanian, V.S.: A semantical framework for supporting subjective and conditional probabilities in deductive databases. ARJ 10(2), (1993)

  33. Ng, R.T., Subrahmanian, V.S.: Stable semantics for probabilistic deductive databases. Inf. Comput. 110(1), (1994)

  34. Nicolas, P., Garcia, L., Stéphan, I.: Possibilistic stable models. In: Proceedings of the International Joint Conference on Artificial Intelligence. Morgan Kaufmann, San Mateo, CA (2005)

    Google Scholar 

  35. Saad, E.: Hybrid probabilistic programs with non-monotonic negation: semantics and algorithms. Ph.D. thesis, New Mexico State University, May (2005)

  36. Saad, E.: Incomplete knowledge in hybrid probabilistic logic programs. In: Proceedings of the Tenth European Conference on Logics in Artificial Intelligence (Jelia’06). Springer, Berlin Heidelberg New York (2006)

    Google Scholar 

  37. Saad, E.: Towards the computation of the stable probabilistic model semantics. In: Proceedings of the 29th Annual German Conference on Artificial Intelligence (KI’06). Bremen, Germany, June (2006)

    Google Scholar 

  38. Saad, E., Pontelli, E.: Towards a more practical hybrid probabilistic logic programming framework. In: Proceedings of the Symposium on Practical Aspects of Declarative Languages. Springer, Berlin Heidelberg New York (2005)

    Google Scholar 

  39. Sagonas, K., Swift, T., Warren, D.S.: An abstract machine for efficiently computing queries to well-founded models. J. Log. Program. 45(1–3), 1–41 (2000)

    Article  MATH  Google Scholar 

  40. Sato, T., Kameya, Y.: PRISM: Language for symbolic-statistical modeling. In: Proceedings of the International Joint Conferences on Artificial Intelligence. Morgan Kaufmann, San Mateo, CA (1997)

    Google Scholar 

  41. Shapiro, E.: Logic programs with uncertainties: a tool for implementing expert systems. In: Proc. of IJCAI, pages 529–532. Morgan Kaufmann, San Mateo, CA (1983)

    Google Scholar 

  42. Subrahmanian, V.S.: On the semantics of quantitative logic programs. In: Proceedings of the International Symposium on Logic Programming, pp. 173–182. IEEE Computer Society, Los Alamitos, CA (1987)

    Google Scholar 

  43. Subrahmanian, V.S.: Amalgamating knowledge bases. ACM Trans. Database Syst. 19(2), 291–331 (1994)

    Article  Google Scholar 

  44. van Emden, M.H.: Quantitative deduction and its fixpoint theory. J. Log. Program. 4(1), 37–53 (1986)

    Article  Google Scholar 

  45. Vennekens, J., Verbaeten, S.: A general view on probabilistic logic programming. In Belgian-Dutch Conference on AI (2003)

Download references

Author information

Authors and Affiliations

  1. College of Computer Science and Information Technology, Abu Dhabi University, P.O. Box 59911, Abu Dhabi, UAE

    Emad Saad

  2. Department of Computer Science, New Mexico State University, Las Cruces, NM, 88003, USA

    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

Corresponding author

Correspondence to Emad Saad.

Additional information

An erratum to this article can be found at http://dx.doi.org/10.1007/s10472-007-9082-1

Rights and permissions

Reprints and permissions

About this article

Cite this article

Saad, E., Pontelli, E. A new approach to hybrid probabilistic logic programs. Ann Math Artif Intell 48, 187–243 (2006). https://doi.org/10.1007/s10472-007-9048-3

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10472-007-9048-3

Keywords

Mathematics Subject Classification (2000)

Search

Navigation