Skip to main content
SpringerLink
Log in

Hybrid Probabilistic Logic Programs as Residuated Logic Programs

  • Conference paper
  • First Online:
Book cover Logics in Artificial Intelligence (JELIA 2000)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1919))

Included in the following conference series:

Abstract

In this paper we show the embedding of Hybrid Probabilistic Logic Programs into the rather general framework of Residuated Logic Programs, where the main results of (definite) logic programming are validly extrapolated, namely the extension of the immediate consequences operator of van Emden and Kowalski. The importance of this result is that for the first time a framework encompassing several quite distinct logic programming semantics is described, namely Generalized Annotated Logic Programs, Fuzzy Logic Programming, Hybrid Probabilistic Logic Programs, and Possibilistic Logic Programming. Moreover, the embedding provides a more general semantical structure paving the way for defining paraconsistent probabilistic reasoning logic programming semantics.

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. L. Bolc and P. Borowik. Many-Valued Logics. Theoretical Foundations. Springer-Verlag, 1992.

    Google Scholar 

  2. C. V. Damásio and L. M. Pereira. Residuated logic programs. Technical report, Universidade Nova de Lisboa, 2000. Available at http://centria.di.fct.unl.pt/~cd.

  3. A. Dekhtyar, M. Dekhtyar, and V. S. Subrahmanian. Hybrid probabilistic programs: Algorithms and complexity. In Proc. of 1999 Conference on Uncertainty in AI, 1999.

    Google Scholar 

  4. A. Dekhtyar and V. S. Subrahmanian. Hybrid probabilistic programs. J. of Logic Programming, 43:187–250, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  5. R. P. Dilworth and M. Ward. Residuated lattices. Trans. A.M.S., 45:335–354, 1939.

    Article  MATH  MathSciNet  Google Scholar 

  6. D. Dubois, J. Lang, and H. Prade. Fuzzy sets in approximate reasoning, part 2: Logical approaches. Fuzzy Sets and Systems, 40:203–244, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  7. D. Dubois, J. Lang, and H. Prade. Towards possibilistic logic programming. In International Conference on Logic Programming 1991, pages 581–598. MIT Press, 1991.

    Google Scholar 

  8. J. H. Gallier. Logic for Computer Science. John Wiley & Sons, 1987.

    Google Scholar 

  9. P. H·jek. Metamathematics of Fuzzy Logic. Trends in Logic. Studia Logica Library. Kluwer Academic Publishers, 1998.

    Google Scholar 

  10. M. Kifer and V. S. Subrahmanian. Theory of generalized annotated logic programming and its applications. J. of Logic Programming, 12:335–367, 1992.

    Article  MathSciNet  Google Scholar 

  11. R. Kowalski. Predicate logic as a programming language. In Proceedings of IFIP’74, pages 569–574. North Holland Publishing Company, 1974.

    Google Scholar 

  12. J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag, 1987. 2nd. edition.

    Google Scholar 

  13. J. Pavelka. On fuzzy logic I, II, III. Zeitschr. f. Math. Logik und Grundl. der Math., 25, 1979.

    Google Scholar 

  14. M. van Emden and R. Kowalski. The semantics of predicate logic as a programming language. Journal of ACM, 4(23):733–742, 1976.

    Article  Google Scholar 

  15. P. Vojt·s and L. Paulík. Soundness and completeness of non-classical extended SLD-resolution. InProc. of theWs. on Extensions of Logic Programming (ELP’96), pages 289–301. LNCS 1050, Springer-Verlag., 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Centro de Inteligéncia Artificial (CENTRIA) Departamento de Informática, Faculdade de Ciéncias e Tecnologia, Universidade Nova de Lisboa, 2825-114, Caparica, Portugal

    Carlos Viegas Damásio & Luís Moniz Pereira

Authors
  1. Carlos Viegas Damásio
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Luís Moniz Pereira
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Applied Mathematics, E.T.S.I. Informática, University of Málaga, 29071, Málaga, Spain

    Manuel Ojeda-Aciego  & Inma P. de Guzmán  & 

  2. Intelligent Systems Department, Computer Science Institute, University of Leipzig, Augustusplatz 10-11, 04109, Leipzig, Germany

    Gerhard Brewka

  3. Center for Artificial Intelligence, Department of Computer Science, University of Lisbon, 2825-114, Caparica, Portugal

    Luís Moniz Pereira

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Damásio, C.V., Pereira, L.M. (2000). Hybrid Probabilistic Logic Programs as Residuated Logic Programs. In: Ojeda-Aciego, M., de Guzmán, I.P., Brewka, G., Moniz Pereira, L. (eds) Logics in Artificial Intelligence. JELIA 2000. Lecture Notes in Computer Science(), vol 1919. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-40006-0_5

Download citation

  • DOI: https://doi.org/10.1007/3-540-40006-0_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41131-4

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation