Skip to main content
Springer Nature Link
Log in

Formal Properties of Modularisation

  • Chapter
Modular Ontologies

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5445))

Summary

Modularity of ontologies is currently an active research field, and many different notions of a module have been proposed. In this paper, we review the fundamental principles of modularity and identify formal properties that a robust notion of modularity should satisfy. We explore these properties in detail in the contexts of description logic and classical predicate logic and put them into the perspective of well-known concepts from logic and modular software specification such as interpolation, forgetting and uniform interpolation. We also discuss reasoning problems related to modularity.

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. Artale, A., Calvanese, D., Kontchakov, R., Zakharyaschev, M.: DL-Lite in the light of first-order logic. In: Proceedings of AAAI 2007, pp. 361–366. AAAI Press, Menlo Park (2007)

    Google Scholar 

  2. Baader, F., Brandt, S., Lutz, C.: Pushing the \(\mathcal{EL}\) envelope. In: Proceedings of IJCAI 2005, pp. 364–369. Professional Book Center (2005)

    Google Scholar 

  3. Baader, F., Calvanes, D., McGuiness, D., Nardi, D., Patel-Schneider, P.: The Description Logic Handbook: Theory, implementation and applications. Cambridge University Press, Cambridge (2003)

    Google Scholar 

  4. Bao, J., Caragea, D., Honavar, V.: On the semantics of linking and importing in modular ontologies. In: Cruz, I., Decker, S., Allemang, D., Preist, C., Schwabe, D., Mika, P., Uschold, M., Aroyo, L.M. (eds.) ISWC 2006. LNCS, vol. 4273, pp. 72–86. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  5. Bechhofer, S., van Harmelen, F., Hendler, J., Horrocks, I., McGuinness, D.L., Patel-Schneider, P., Stein, L.: OWL Web Ontology Language reference. W3C Recommendation (February 10, 2004)

    Google Scholar 

  6. Bouquet, P., Giunchiglia, F., van Harmelen, F., Serafini, L., Stuckenschmidt, H.: Contextualizing ontologies. Journal of Web Semantics 1(4), 325–343 (2004)

    Article  Google Scholar 

  7. Bradfield, J., Stirling, C.: Modal mu-calculus. In: Blackburn, P., van Benthem, J., Wolter, F. (eds.) Handbook of Modal Logic. Elsevier, Amsterdam (2006)

    Google Scholar 

  8. Byers, P., Pitt, D.H.: Conservative extensions: a cautionary note. Bulletin of the EATCS 41, 196–201 (1990)

    MATH  Google Scholar 

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

    Google Scholar 

  10. Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Data complexity of query answering in description logics. In: Proceedings of KR 2006, pp. 260–270. AAAI Press, Menlo Park (2006)

    Google Scholar 

  11. Calvanese, D., Eiter, T., Ortiz, M.: Answering regular path queries in expressive description logics: An automata-theoretic approach. In: Proceedings of AAAI 2007, pp. 391–396. AAAI Press, Menlo Park (2007)

    Google Scholar 

  12. ten Cate, B., Conradie, W., Marx, M., Venema, Y.: Definitorially complete description logics. In: Proceedings of KR 2006, pp. 79–89. AAAI Press, Menlo Park (2006)

    Google Scholar 

  13. Chang, C.C., Keisler, H.J.: Model Theory. Studies in Logic and the Foundations of Mathematics, vol. 73. Elsevier, Amsterdam (1990)

    MATH  Google Scholar 

  14. Cuenca Grau, B., Horrocks, I., Kazakov, Y., Sattler, U.: Just the right amount: Extracting modules from ontologies. In: Proceedings of WWW 2007, pp. 717–727. ACM, New York (2007)

    Google Scholar 

  15. Cuenca Grau, B., Horrocks, I., Kazakov, Y., Sattler, U.: A logical framework for modularity of ontologies. In: Proceedings of IJCAI 2007, pp. 298–303. AAAI Press, Menlo Park (2007)

    Google Scholar 

  16. Cuenca Grau, B., Horrocks, I., Kazakov, Y., Sattler, U.: Modular reuse of ontologies: Theory and practice. Journal of Artificial Intelligence Research 31, 273–318 (2008)

    MathSciNet  MATH  Google Scholar 

  17. Cuenca Grau, B., Parsia, B., Sirin, E., Kalyanpur, A.: Modularity and web ontologies. In: Proceedings of KR 2006, pp. 198–209. AAAI Press, Menlo Park (2006)

    Google Scholar 

  18. D’Agostino, G., Hollenberg, M.: Uniform interpolation, automata, and the modal μ-calculus. In: Proceedings of AiML 1998, vol. 1. CSLI Publishers (1998)

    Google Scholar 

  19. Eiter, T., Fink, M., Woltran, S.: Semantical characterizations and complexity of equivalences in answer set programming. ACM Transactions in Computational Logic 8(3) (2007)

    Google Scholar 

  20. Gabbay, D.M., Kurucz, A., Wolter, F., Zakharyaschev, M.: Many-Dimensional Modal Logics: Theory and Applications. Studies in Logic and the Foundations of Mathematics, vol. 148. Elsevier, Amsterdam (2003)

    MATH  Google Scholar 

  21. Ghilardi, S., Lutz, C., Wolter, F.: Did I damage my ontology? A case for conservative extensions in description logic. In: Proceedings of KR 2006, pp. 187–197. AAAI Press, Menlo Park (2006)

    Google Scholar 

  22. Ghilardi, S., Zawadowski, M.: Undefinability of propositional quantifiers in the modal system S4. Studia Logica 55(2), 259–271 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  23. Glimm, B., Lutz, C., Horrocks, I., Sattler, U.: Answering conjunctive queries in the \(\mathcal{SHIQ}\) description logic. Journal of Artificial Intelligence Research 31, 150–197 (2008)

    MATH  Google Scholar 

  24. Goguen, J.A., Burstall, R.M.: Institutions: Abstract model theory for specification and programming. Journal of ACM 39(1), 95–146 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  25. Goguen, J.A., Diaconescu, R., Stefaneas, P.: Logical support for modularisation. In: Proceedings of Logical Environments, pp. 83–130. Cambridge University Press, Cambridge (1993)

    Google Scholar 

  26. Goranko, V., Otto, M.: Model theory of modal logic. In: Blackburn, P., van Benthem, J., Wolter, F. (eds.) Handbook of Modal Logic. Elsevier, Amsterdam (2007)

    Google Scholar 

  27. Konev, B., Lutz, C., Walther, D., Wolter, F.: Semantic modularity and module extraction in description logics. In: Proceedings of ECAI 2008, pp. 55–59. IOS Press, Amsterdam (2008)

    Google Scholar 

  28. Konev, B., Walther, D., Wolter, F.: The logical difference problem for description logic terminologies. In: Armando, A., Baumgartner, P., Dowek, G. (eds.) IJCAR 2008. LNCS, vol. 5195, pp. 259–274. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  29. Kontchakov, R., Wolter, F., Zakharyaschev, M.: Modularity in DL-Lite. In: Proceedings of DL 2007, pp. 76–87. CEUR-WS (2007)

    Google Scholar 

  30. Kontchakov, R., Wolter, F., Zakharyaschev, M.: Can you tell the difference between DL-Lite ontologies. In: Proceedings of KR 2008, pp. 285–295. AAAI Press, Menlo Park (2008)

    Google Scholar 

  31. Kutz, O., Lutz, C., Wolter, F., Zakharyaschev, M.: E-connections of abstract description systems. Artificial Intelligence 156(1), 1–73 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  32. Kutz, O., Mossakowski, T.: Conservativity in structured ontologies. In: Proceedings of ECAI 2008. IOS Press, Amsterdam (2008)

    Google Scholar 

  33. Lang, J., Liberatore, P., Marquis, P.: Propositional independence: formula-variable independence and forgetting. Journal of Artificial Intelligence Research 18, 391–443 (2003)

    MathSciNet  MATH  Google Scholar 

  34. Lifschitz, V., Pearce, D., Valverde, A.: Strongly equivalent logic programs. ACM Transactions on Computational Logic 2(4), 526–541 (2001)

    Article  MathSciNet  Google Scholar 

  35. Lüttich, K., Masolo, C., Borgo, S.: Development of modular ontologies in CASL. In: Proceedings of WoMO 2006, CEUR-WS (2006)

    Google Scholar 

  36. Lutz, C., Walther, D., Wolter, F.: Conservative extensions in expressive description logics. In: Proceedings of IJCAI 2007, pp. 453–458. AAAI Press, Menlo Park (2007)

    Google Scholar 

  37. Lutz, C., Wolter, F.: Conservative extensions in the lightweight description logic \(\mathcal{EL}\). In: Pfenning, F. (ed.) CADE 2007. LNCS, vol. 4603, pp. 84–99. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  38. Lutz, C., Wolter, F.: Deciding inseparability and conservative extensions in the description logic \(\mathcal{EL}\). Technical report, University of Liverpool (2008)

    Google Scholar 

  39. Maibaum, T.S.E.: Conservative extensions, interpretations between theories and all that! In: Bidoit, M., Dauchet, M. (eds.) TAPSOFT 1997. LNCS, vol. 1214, pp. 40–66. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  40. Maksimova, L.: Complexity of interpolation and related problems in positive calculi. Journal of Symbolic Logic 67(1), 397–408 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  41. Pitts, A.: On an interpretation of second-order quantification in first-order intuitionistic propositional logic. Journal of Symbolic Logic 57(1), 33–52 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  42. Reiter, R., Lin, F.: Forget it! In: Proceedings of AAAI Fall Symposium on Relevance, pp. 154–159. AAAI Press, Menlo Park (1994)

    Google Scholar 

  43. Schorlemmer, M., Kalfoglou, Y.: Institutionalising ontology-based semantic integration. Applied Ontology (to appear, 2008)

    Google Scholar 

  44. Serafini, L., Borgida, A., Tamilin, A.: Aspects of distributed and modular ontology reasoning. In: Proceedings of IJCAI 2005, pp. 570–575. Professional Book Center (2005)

    Google Scholar 

  45. Spackman, K.: Managing clinical terminology hierarchies using algorithmic calculation of subsumption: Experience with SNOMED-RT. In: JAMIA (2000); Fall Symposium Special Issue

    Google Scholar 

  46. Veloso, P.: Yet another cautionary note on conservative extensions: a simple case with a computing flavour. EATCS-Bulletin 46, 188–193 (1992)

    MATH  Google Scholar 

  47. Veloso, P., Veloso, S.: Some remarks on conservative extensions. a socratic dialog. EATCS-Bulletin 43, 189–198 (1991)

    MATH  Google Scholar 

  48. Visser, A.: Uniform interpolation and layered bisimulation. In: Gödel 1996, Brno. Lecture Notes in Logic, vol. 6. Springer, Heidelberg (1996)

    Google Scholar 

  49. Wang, Z., Wang, K., Topor, R.W., Pan, J.Z.: Forgetting Concepts in DL-Lite. In: Proceedings of ESWC 2008, pp. 245–257. IOS Press, Amsterdam (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Liverpool, UK

    Boris Konev, Dirk Walther & Frank Wolter

  2. University of Bremen, Germany

    Carsten Lutz

Authors
  1. Boris Konev
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Carsten Lutz
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Dirk Walther
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Frank Wolter
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informatik, B6, 26, Universität Mannheim, 68159, Mannheim, Germany

    Heiner Stuckenschmidt

  2. HEC ISI, Université de Lausanne, 1015, Lausanne, Switzerland

    Christine Parent

  3. Database Laboratory, École Polytechnique Fédérale de Lausanne, EPFL-IC, 1015, Lausanne, Switzerland

    Stefano Spaccapietra

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Konev, B., Lutz, C., Walther, D., Wolter, F. (2009). Formal Properties of Modularisation. In: Stuckenschmidt, H., Parent, C., Spaccapietra, S. (eds) Modular Ontologies. Lecture Notes in Computer Science, vol 5445. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01907-4_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-01907-4_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-01906-7

  • Online ISBN: 978-3-642-01907-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics