Conservative Extensions in the Lightweight Description Logic \(\mathcal{EL}\)

  • Carsten Lutz
  • Frank Wolterinst
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4603)

Abstract

We bring together two recent trends in description logic (DL): lightweight DLs in which the subsumption problem is tractable and conservative extensions as a central tool for formalizing notions of ontology design such as refinement and modularity. Our aim is to investigate conservative extensions as an automated reasoning problem for the basic tractable DL \(\mathcal{EL}\). The main result is that deciding (deductive) conservative extensions is ExpTime-complete, thus more difficult than subsumption in \(\mathcal{EL}\), but not more difficult than subsumption in expressive DLs. We also show that if conservative extensions are defined model-theoretically, the associated decision problem for \(\mathcal{EL}\) is undecidable.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Antoniou, G., Kehagias, K.: A note on the refinement of ontologies. Int. J. of Intelligent Systems 15, 623–632 (2000)MATHCrossRefGoogle Scholar
  2. 2.
    Baader, F., Brandt, S., Lutz, C.: Pushing the EL envelope. In: Proc. of the 19th Int. Joint Conf. on Artificial Intelligence (IJCAI 2005), pp. 364–369. Professional Book Center (2005)Google Scholar
  3. 3.
    Baader, F., Küsters, R., Molitor, R.: Computing least common subsumers in description logics with existential restrictions. In: Proc. of the 16th Int. Joint Conf. on Artificial Intelligence (IJCAI 1999), pp. 96–101. Morgan Kaufmann, San Francisco (1999)Google Scholar
  4. 4.
    Bloom, B., Paige, R.: Transformational design and implementation of a new efficient solution to the ready simulation problem. Sci. Comput. Program. 24(3), 189–220 (1995)MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Brandt, S.: Polynomial time reasoning in a description logic with existential restrictions, GCI axioms, and—what else? In: Proc. of the 16th European Conf. on Artificial Intelligence (ECAI-2004), pp. 298–302. IOS Press, Amsterdam (2004)Google Scholar
  6. 6.
    Calvanese, D., De Giacomo, G., Lenzerini, M.: On the decidability of query containment under constraints. In: Proc. of the 17th Symposium on Principles of Database Systems (PODS 1998), pp. 149–158 (1998)Google Scholar
  7. 7.
    Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: DL-Lite: Tractable description logics for ontologies. In: Proc. of the 20th Nat. Conf. on Artificial Intelligence (AAAI 2005), pp. 602–607 (2005)Google Scholar
  8. 8.
    Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Data complexity of query answering in description logics. In: Proc. of the 10th Int. Conf. on Principles of Knowledge Representation and Reasoning (KR 2006), pp. 260–270 (2006)Google Scholar
  9. 9.
    Clarke, E., Schlingloff, H.: Model checking. In: Handbook of Automated Reasoning, ch. 24, vol. II, pp. 1635–1790. Elsevier, Amsterdam (2001)CrossRefGoogle Scholar
  10. 10.
    Ghilardi, S., Lutz, C., Wolter, F.: Did I damage my ontology? A case for conservative extensions in description logics. In: Proc. of the 10th Int. Conf. on Principles of Knowledge Repr. and Reasoning (KR 2006), pp. 187–197. AAAI Press, Stanford (2006)Google Scholar
  11. 11.
    Grau, B.C., Horrocks, I., Kazakov, Y., Sattler, U.: A logical framework for modularity of ontologies. In: Proc. of the 20th Int. Joint Conf. on Artificial Intelligence (IJCAI 2007), AAAI Press, Stanford (2007)Google Scholar
  12. 12.
    Grau, B.C., Parsia, B., Sirin, E., Kalyanpur, A.: Modularity and web ontologies. In: Proc. of the 10th Int. Conf. on Principles of Knowledge Repr. and Reasoning (KR 2006), pp. 198–209. AAAI Press, Stanford (2006)Google Scholar
  13. 13.
    Lutz, C., Walther, D., Wolter, F.: Conservative extensions in expressive description logics. In: Proc. of the 20th Int. Joint Conf. on Artificial Intelligence IJCAI-2007, AAAI Press, Stanford (2007)Google Scholar
  14. 14.
    Lutz, C., Wolter, F.: Conservative extensions in the lightweight description logic EL (2007), http://www.liv.csc.ac.uk/~frank
  15. 15.
    Sioutos, N., de Coronado, S., Haber, M., Hartel, F., Shaiu, W., Wright, L.: NCI thesaurus: a semantic model integrating cancer-related clinical and molecular information. Journal of Biomedical Informatics 40(1), 30–43 (2006)CrossRefGoogle Scholar
  16. 16.
    Spackman, K.: Managing clinical terminology hierarchies using algorithmic calculation of subsumption: Experience with SNOMED-RT, Fall Symposium Special Issue (2000)Google Scholar
  17. 17.
    Stockmeyer, L.J., Chandra, A.K.: Provably difficult combinatorial games. SIAM Journal on Computing 8(2), 151–174 (1979)MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Carsten Lutz
    • 1
  • Frank Wolterinst
    • 2
  1. 1.Institute for Theoretical Computer Science, TU DresdenGermany
  2. 2.Department of Computer Science, University of LiverpoolUK

Personalised recommendations