Skip to main content
Springer Nature Link
Log in

Tightly Integrated Probabilistic Description Logic Programs for Representing Ontology Mappings

  • Conference paper
Foundations of Information and Knowledge Systems (FoIKS 2008)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 4932))

Abstract

Creating mappings between ontologies is a common way of approaching the semantic heterogeneity problem on the Semantic Web. To fit into the landscape of semantic web languages, a suitable, logic-based representation formalism for mappings is needed. We argue that such a formalism has to be able to deal with uncertainty and inconsistencies in automatically created mappings. We analyze the requirements for such a formalism, and we propose a novel approach to probabilistic description logic programs as such a formalism, which tightly combines disjunctive logic programs under the answer set semantics with both description logics and Bayesian probabilities. We define the language, and we show that it can be used to resolve inconsistencies and merge mappings from different matchers based on the level of confidence assigned to different rules. Furthermore, we explore the computational aspects of consistency checking and query processing in tightly integrated probabilistic description logic programs. We show that these problems are decidable and computable, respectively, and that they can be reduced to consistency checking and cautious/brave reasoning, respectively, in tightly integrated disjunctive description logic programs. We also analyze the complexity of consistency checking and query processing in the new probabilistic description logic programs in special cases. In particular, we present a special case of these problems with polynomial data complexity.

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. Calì, A., Lukasiewicz, T.: Tightly integrated probabilistic description logic programs for the Semantic Web. In: Dahl, V., Niemelä, I. (eds.) ICLP 2007. LNCS, vol. 4670, pp. 428–429. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  2. da Costa, P.C.G.: Bayesian Semantics for the Semantic Web. Doctoral Dissertation, George Mason University, Fairfax, VA, USA (2005)

    Google Scholar 

  3. da Costa, P.C.G., Laskey, K.B.: PR-OWL: A framework for probabilistic ontologies. In: Proc. FOIS-2006, pp. 237–249. IOS Press, Amsterdam (2006)

    Google Scholar 

  4. Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: DL-Lite: Tractable description logics for ontologies. In: Proc. AAAI-2005, pp. 602–607. AAAI Press / MIT Press (2005)

    Google Scholar 

  5. Dantsin, E., Eiter, T., Gottlob, G., Voronkov, A.: Complexity and expressive power of logic programming. ACM Comput. Surv. 33(3), 374–425 (2001)

    Article  Google Scholar 

  6. 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. AAAI Press, California (2004)

    Google Scholar 

  7. Eiter, T., Ianni, G., Lukasiewicz, T., Schindlauer, R., Tompits, H.: Combining answer set programming with description logics for the Semantic Web. Technical Report INFSYS RR-1843-07-04, Institut für Informationssysteme, TU Wien (March 2007)

    Google Scholar 

  8. Eiter, T., Ianni, G., Schindlauer, R., Tompits, H.: Effective integration of declarative rules with external evaluations for semantic-web reasoning. In: Sure, Y., Domingue, J. (eds.) ESWC 2006. LNCS, vol. 4011, pp. 273–287. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  9. Euzenat, J., Mochol, M., Shvaiko, P., Stuckenschmidt, H., Svab, O., Svatek, V., van Hage, W.R., Yatskevich, M.: First results of the ontology alignment evaluation initiative 2006. In: Proc. ISWC-2006 Workshop on Ontology Matching (2006)

    Google Scholar 

  10. Euzenat, J., Shvaiko, P.: Ontology Matching. Springer, Heidelberg (2007)

    MATH  Google Scholar 

  11. Euzenat, J., Stuckenschmidt, H., Yatskevich, M.: Introduction to the ontology alignment evaluation 2005. In: Proc. K-CAP-2005 Workshop on Integrating Ontologies (2005)

    Google Scholar 

  12. Faber, W., Leone, N., Pfeifer, G.: Recursive aggregates in disjunctive logic programs: Semantics and complexity. In: Alferes, J.J., Leite, J.A. (eds.) JELIA 2004. LNCS (LNAI), vol. 3229, pp. 200–212. Springer, Heidelberg (2004)

    Google Scholar 

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

    Google Scholar 

  14. Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Generation Comput. 9(3/4), 365–386 (1991)

    Article  Google Scholar 

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

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

    Google Scholar 

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

  18. Lukasiewicz, T.: A novel combination of answer set programming with description logics for the Semantic Web. In: Franconi, E., Kifer, M., May, W. (eds.) ESWC 2007. LNCS, vol. 4519, pp. 384–398. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  19. Lukasiewicz, T.: Expressive probabilistic description logics. Artif. Intell. (in press)

    Google Scholar 

  20. Lukasiewicz, T.: Probabilistic description logic programs. Int. J. Approx. Reason. 45(2), 288–307 (2007)

    MATH  MathSciNet  Google Scholar 

  21. Lukasiewicz, T.: Tractable probabilistic description logic programs. In: Prade, H., Subrahmanian, V.S. (eds.) SUM 2007. LNCS (LNAI), vol. 4772, pp. 143–156. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  22. Lukasiewicz, T., Straccia, U.: Top-k retrieval in description logic programs under vagueness for the Semantic Web. In: Prade, H., Subrahmanian, V.S. (eds.) SUM 2007. LNCS (LNAI), vol. 4772, pp. 16–30. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  23. Meilicke, C., Stuckenschmidt, H., Tamilin, A.: Repairing ontology mappings. In: Proc. AAAI-2007, pp. 1408–1413. AAAI Press, California (2007)

    Google Scholar 

  24. Motik, B., Horrocks, I., Rosati, R., Sattler, U.: Can OWL and logic programming live together happily ever after? In: Cruz, I., Decker, S., Allemang, D., Preist, C., Schwabe, D., Mika, P., Uschold, M., Aroyo, L. (eds.) ISWC 2006. LNCS, vol. 4273, pp. 501–514. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  25. Wang, P., Xu, B.: Debugging ontology mapping: A static method. Computation and Intelligence (to appear, 2007)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  27. Serafini, L., Stuckenschmidt, H., Wache, H.: A formal investigation of mapping languages for terminological knowledge. In: Proc. IJCAI-2005, pp. 576–581 (2005)

    Google Scholar 

  28. Straccia, U.: Towards top-k query answering in description logics: The case of DL-Lite. In: Fisher, M., van der Hoek, W., Konev, B., Lisitsa, A. (eds.) JELIA 2006. LNCS (LNAI), vol. 4160, pp. 439–451. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computing Laboratory, University of Oxford, UK

    Andrea Calì

  2. Dipartimento di Informatica e Sistemistica, Sapienza Università di Roma, Italy

    Thomas Lukasiewicz

  3. Institut für Informationssysteme, Technische Universität Wien, Austria

    Thomas Lukasiewicz

  4. Institut für Informatik, Universität Mannheim, Germany

    Livia Predoiu & Heiner Stuckenschmidt

Authors
  1. Andrea Calì
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Thomas Lukasiewicz
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Livia Predoiu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Heiner Stuckenschmidt
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Sven Hartmann Gabriele Kern-Isberner

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Calì, A., Lukasiewicz, T., Predoiu, L., Stuckenschmidt, H. (2008). Tightly Integrated Probabilistic Description Logic Programs for Representing Ontology Mappings. In: Hartmann, S., Kern-Isberner, G. (eds) Foundations of Information and Knowledge Systems. FoIKS 2008. Lecture Notes in Computer Science, vol 4932. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77684-0_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-77684-0_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-77683-3

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics