Skip to main content
SpringerLink
Log in

Probabilistic Description Logic Programs

  • Conference paper
Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU 2005)

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

Abstract

Towards sophisticated representation and reasoning techniques that allow for probabilistic uncertainty in the Rules, Logic, and Proof layers of the Semantic Web, we present probabilistic description logic programs (or pdl-programs), which are a combination of description logic programs (or dl-programs) under the answer set semantics and the well-founded semantics with Poole’s independent choice logic. We show that query processing in such pdl-programs can be reduced to computing all answer sets of dl-programs and solving linear optimization problems, and to computing the well-founded model of dl-programs, respectively. Furthermore, we show that the answer set semantics of pdl-programs is a refinement of the well-founded semantics of pdl-programs.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Alsaç, G., Baral, C.: Reasoning in description logics using declarative logic programming. Report, Department of Computer Science and Engineering, Arizona State University (2001)

    Google Scholar 

  2. Antoniou, G.: Nonmonotonic rule systems on top of ontology layers. In: Horrocks, I., Hendler, J. (eds.) ISWC 2002. LNCS, vol. 2342, pp. 394–398. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  3. Antoniou, G., Wagner, G.: Rules and defeasible reasoning on the Semantic Web. In: Schröder, M., Wagner, G. (eds.) RuleML 2003. LNCS, vol. 2876, pp. 111–120. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  4. Baader, F., Hollunder, B.: Embedding defaults into terminological representation systems. J. Automated Reasoning 14, 149–180 (1995)

    Article  MathSciNet  Google Scholar 

  5. Berners-Lee, T.: Weaving the Web. Harper, San Francisco (1999)

    Google Scholar 

  6. Boley, H., Tabet, S., Wagner, G.: Design rationale for RuleML: A markup language for Semantic Web rules. In: Proc. SWWS 2001, pp. 381–401 (2001)

    Google Scholar 

  7. Damásio, C.V.: The W4 Project (2002), http://centria.di.fct.unl.pt/~cd/projectos/w4/index.htm

  8. Donini, F.M., Lenzerini, M., Nardi, D., Schaerf, A.: \({\mathcal AL}\)-log: Integrating datalog and description logics. Journal of Intelligent Information Systems (JIIS) 10(3), 227–252 (1998)

    Article  Google Scholar 

  9. Eiter, T., Lukasiewicz, T., Schindlauer, R., Tompits, H.: Combining answer set programming with description logics for the Semantic Web. In: Proc. KR 2004, pp. 141–151 (2004)

    Google Scholar 

  10. Eiter, T., Lukasiewicz, T., Schindlauer, R., Tompits, H.: Well-founded semantics for description logic programs in the Semantic Web. In: Antoniou, G., Boley, H. (eds.) RuleML 2004. LNCS, vol. 3323, pp. 81–97. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  11. Fensel, D., Wahlster, W., Lieberman, H., Hendler, J. (eds.): Spinning the Semantic Web: Bringing the World Wide Web to Its Full Potential. MIT Press, Cambridge (2002)

    Google Scholar 

  12. Finzi, A., Lukasiewicz, T.: Structure-based causes and explanations in the independent choice logic. In: Proc. UAI 2003, pp. 225–232 (2003)

    Google Scholar 

  13. Gelfond, M., Lifschitz, V.: Classical negation in logic programs and deductive databases. New Generation Computing 17, 365–387 (1991)

    Article  Google Scholar 

  14. Giugno, R., Lukasiewicz, T.: P-\(\mathcal{SHOQ}({\bf D})\): A probabilistic extension of \(\mathcal{SHOQ}({\bf D})\) for probabilistic ontologies in the Semantic Web. In: Flesca, S., Greco, S., Leone, N., Ianni, G. (eds.) JELIA 2002. LNCS (LNAI), vol. 2424, pp. 86–97. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  15. Grosof, B.N., Horrocks, I., Volz, R., Decker, S.: Description logic programs: Combining logic programs with description logics. In: Proc. WWW 2003, pp. 48–57 (2003)

    Google Scholar 

  16. Horrocks, I., Patel-Schneider, P.F.: Reducing OWL entailment to description logic satisfiability. In: Fensel, D., Sycara, K., Mylopoulos, J. (eds.) ISWC 2003. LNCS, vol. 2870, pp. 17–29. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  17. Horrocks, I., Patel-Schneider, P.F.: A proposal for an OWL Rules Language. In: Proc. WWW-2004, pp. 723–731 (2004)

    Google Scholar 

  18. Horrocks, I., Patel-Schneider, P.F., van Harmelen, F.: From \({\cal SHIQ}\) and RDF to OWL: The making of a web ontology language. Journal of Web Semantics 1(1), 7–26 (2003)

    Google Scholar 

  19. Horrocks, I., Sattler, U., Tobies, S.: Practical reasoning for expressive description logics. In: Ganzinger, H., McAllester, D., Voronkov, A. (eds.) LPAR 1999. LNCS, vol. 1705, pp. 161–180. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  20. Hufstadt, U., Motik, B., Sattler, U.: Reasoning for description logics around \({\mathcal SHIQ}\) in a resolution framework. Technical Report 3-8-04/04, FZI Karlsruhe (2004)

    Google Scholar 

  21. Levy, A.Y., Rousset, M.-C.: Combining Horn rules and description logics in CARIN. Artif. Intell. 104(1-2), 165–209 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  22. Nottelmann, H., Fuhr, N.: pDAML+OIL: A probabilistic extension to DAML+OIL based on probabilistic Datalog. In: Proc. IPMU 2004 (2004)

    Google Scholar 

  23. Poole, D.: The independent choice logic for modelling multiple agents under uncertainty. Artif. Intell. 94, 7–56 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  24. Rao, P., Sagonas, K., Swift, T., Warren, D.S., Freire, J.: XSB: A system for efficiently computing WFS. In: Fuhrbach, U., Dix, J., Nerode, A. (eds.) LPNMR 1997. LNCS, vol. 1265, pp. 430–440. Springer, Heidelberg (1997)

    Google Scholar 

  25. Rosati, R.: Towards expressive KR systems integrating datalog and description logics: Preliminary report. In: Proc. DL 1999, pp. 160–164

    Google Scholar 

  26. Straccia, U.: Uncertainty and description logic programs: A proposal for expressing rules and uncertainty on top of ontologies. Technical Report ISTI-2004-TR, CNR Pisa (2004)

    Google Scholar 

  27. Swift, T.: Deduction in ontologies via ASP. In: Lifschitz, V., Niemelä, I. (eds.) LPNMR 2004. LNCS (LNAI), vol. 2923, pp. 275–288. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  28. Van Belleghem, K., Denecker, M., De Schreye, D.: A strong correspondence between description logics and open logic programming. In: Proc. ICLP 1997, pp. 346–360 (1997)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  30. W3C. OWL web ontology language overview, 2004. W3C Recommendation (February 10, 2004), Available at http://www.w3.org/TR/2004/REC-owl-features-20040210/

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica e Sistemistica, Università di Roma “La Sapienza”, Via Salaria 113, I-00198, Rome, Italy

    Thomas Lukasiewicz

Authors
  1. Thomas Lukasiewicz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. IIIA - CSIC, 08193, Bellaterra, Spain

    Lluís Godo

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lukasiewicz, T. (2005). Probabilistic Description Logic Programs. In: Godo, L. (eds) Symbolic and Quantitative Approaches to Reasoning with Uncertainty. ECSQARU 2005. Lecture Notes in Computer Science(), vol 3571. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11518655_62

Download citation

  • DOI: https://doi.org/10.1007/11518655_62

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-31888-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation