Skip to main content
SpringerLink
Log in

Hybrid Probabilistic Logic Programs with Non-monotonic Negation

  • Conference paper
Logic Programming (ICLP 2005)

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

Included in the following conference series:

Abstract

In [22], a new Hybrid Probabilistic Logic Programs framework has been proposed, and a new semantics has been developed to enable encoding and reasoning about real-world applications. In this paper, the language of Hybrid Probabilistic Logic Programs framework of [22] is extended to allow non-monotonic negation, and two alternative semantics are defined: stable probabilistic model semantics and probabilistic well-founded semantics. Stable probabilistic model semantics and probabilistic well-founded semantics generalize stable model semantics and well-founded semantics of traditional normal logic programs, and they reduce to the semantics of original Hybrid Probabilistic Logic programs framework of [22] 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 development provides a foundational ground for developing computational methods for computing 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 chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    Article  MathSciNet  Google Scholar 

  2. Baral, C., et al.: Probabilistic reasoning with answer sets. In: Lifschitz, V., Niemelä, I. (eds.) LPNMR 2004. LNCS (LNAI), vol. 2923, pp. 21–33. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

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

    Google Scholar 

  4. Damasio, C.V., et al.: Coherent well-founded annotated logic programs. In: Gelfond, M., Leone, N., Pfeifer, G. (eds.) LPNMR 1999. LNCS (LNAI), vol. 1730, p. 262. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  5. Dekhtyar, A., Subrahmanian, V.S.: Hybrid probabilistic program. Journal of Logic Programming 43(3), 187–250 (2000)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  7. Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: ICSLP. MIT Press, Cambridge (1988)

    Google Scholar 

  8. Van Gelder, A.: The alternating fixpoint of logic programs with negation. Journal of Computer and System Sciences 47(1), 185–221 (1993)

    Article  MATH  MathSciNet  Google Scholar 

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

    MATH  Google Scholar 

  10. 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 

  11. Lakshmanan, L.V.S., Sadri, F.: On a theory of probabilistic deductive databases. Journal of Theory and Practice of Logic Programming 1(1), 5–42 (2001)

    Article  MathSciNet  Google Scholar 

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

    Google Scholar 

  13. Loyer, Y., Straccia, U.: The well-founded semantics in normal logic programs with uncertainty. In: FLOPS. Springer, Heidelberg (2002)

    Google Scholar 

  14. Loyer, Y., Straccia, U.: The approximate well-founded semantics for logic programs with uncertainty. In: 28th International Symposium on Mathematical Foundations of Computer Science (2003)

    Google Scholar 

  15. Lukasiewicz, T.: Probabilistic logic programming. In: 13th European Conference on Artificial Intelligence, pp. 388–392 (1998)

    Google Scholar 

  16. Lukasiewicz, T.: Many-valued disjunctive logic programs with probabilistic semantics. In: Gelfond, M., Leone, N., Pfeifer, G. (eds.) LPNMR 1999. LNCS (LNAI), vol. 1730, p. 277. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  17. 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 (1996)

    Google Scholar 

  18. Ng, R.T., Subrahmanian, V.S.: Probabilistic logic programming. Information & Computation 101(2) (1992)

    Google Scholar 

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

    Google Scholar 

  20. Ng, R.T., Subrahmanian, V.S.: Stable semantics for probabilistic deductive databases. Information & Computation 110(1) (1994)

    Google Scholar 

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

    Google Scholar 

  22. Saad, E., Pontelli, E.: Towards a more practical hybrid probabilistic logic programming framework. In: Practical Aspects of Declarative Languages. Springer, Heidelberg (2005)

    Google Scholar 

  23. Subrahmanian, V.S.: Amalgamating knowledge bases. ACM TDS 19(2), 291–331 (1994)

    Article  MathSciNet  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. Dipartimento di Scienze dell’Informazione, Università di Bologna, Italy

    Maurizio Gabbrielli

  2. Department of Computer Science, University of Texas at Dallas, 75080, Richardson, TX

    Gopal Gupta

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Saad, E., Pontelli, E. (2005). Hybrid Probabilistic Logic Programs with Non-monotonic Negation. In: Gabbrielli, M., Gupta, G. (eds) Logic Programming. ICLP 2005. Lecture Notes in Computer Science, vol 3668. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11562931_17

Download citation

  • DOI: https://doi.org/10.1007/11562931_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29208-1

  • Online ISBN: 978-3-540-31947-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation