Skip to main content
SpringerLink
Log in

Error-Tolerant Reasoning in the Description Logic \(\mathcal{E{\kern-.1em}L}\)

  • Conference paper
Logics in Artificial Intelligence (JELIA 2014)

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

Included in the following conference series:

Abstract

Developing and maintaining ontologies is an expensive and error-prone task. After an error is detected, users may have to wait for a long time before a corrected version of the ontology is available. In the meantime, one might still want to derive meaningful knowledge from the ontology, while avoiding the known errors. We study error-tolerant reasoning tasks in the description logic \(\mathcal{E{\kern-.1em}L}\). While these problems are intractable, we propose methods for improving the reasoning times by precompiling information about the known errors and using proof-theoretic techniques for computing justifications. A prototypical implementation shows that our approach is feasible for large ontologies used in practice.

Partially supported by DFG within the Cluster of Excellence ‘cfAED’.

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. Arenas, M., Bertossi, L., Chomicki, J.: Consistent query answers in inconsistent databases. In: Proceedings of the 18th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS 1999), pp. 68–79. ACM (1999)

    Google Scholar 

  2. Baader, F.: Terminological cycles in a description logic with existential restrictions. In: Gottlob, G., Walsh, T. (eds.) Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI 2003), pp. 325–330. Morgan Kaufmann (2003)

    Google Scholar 

  3. Baader, F., Calvanese, D., McGuinness, D.L., Nardi, D., Patel-Schneider, P.F. (eds.): The Description Logic Handbook: Theory, Implementation, and Applications, 2nd edn. Cambridge University Press (2007)

    Google Scholar 

  4. Baader, F., Knechtel, M., Peñaloza, R.: Context-dependent views to axioms and consequences of semantic web ontologies. Journal of Web Semantics 12-13, 22–40 (2012), available at http://dx.doi.org/10.1016/j.websem.2011.11.006

    Google Scholar 

  5. Baader, F., Peñaloza, R.: Automata-based axiom pinpointing. Journal of Automated Reasoning 45(2), 91–129 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  6. Baader, F., Peñaloza, R.: Axiom pinpointing in general tableaux. Journal of Logic and Computation 20(1), 5–34 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  7. Baader, F., Peñaloza, R., Suntisrivaraporn, B.: Pinpointing in the description logic \(\mathcal{EL}^+\). In: Hertzberg, J., Beetz, M., Englert, R. (eds.) KI 2007. LNCS (LNAI), vol. 4667, pp. 52–67. Springer, Heidelberg (2007)

    Google Scholar 

  8. Baader, F., Suntisrivaraporn, B.: Debugging SNOMED CT using axiom pinpointing in the description logic \(\mathcal{EL}^+\). In: Proceedings of the 3rd Knowledge Representation in Medicine (KR-MED 2008): Representing and Sharing Knowledge Using SNOMED, vol. 410, CEUR-WS (2008)

    Google Scholar 

  9. Bertossi, L.: Database repairing and consistent query answering. Synthesis Lectures on Data Management 3(5), 1–121 (2011)

    Article  Google Scholar 

  10. Bienvenu, M.: On the complexity of consistent query answering in the presence of simple ontologies. In: Proceedings of the 26th Natonal Conference on Artificial Intelligence, AAAI 2012 (2012)

    Google Scholar 

  11. Bienvenu, M., Rosati, R.: Tractable approximations of consistent query answering for robust ontology-based data access. In: Rossi, F. (ed.) Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI 2013). AAAI Press (2013)

    Google Scholar 

  12. Booth, R., Meyer, T., Varzinczak, I.J.: First steps in \(\mathcal{E{\kern-.1em}L}\) contraction. In: Proceedings of the 2009 Workshop on Automated Reasoning About Context and Ontology Evolution, ARCOE 2009 (2009)

    Google Scholar 

  13. Brandt, S.: Polynomial time reasoning in a description logic with existential restrictions, GCI axioms, and - what else? In: de Mántaras, R.L., Saitta, L. (eds.) Proceedings of the 16th European Conference on Artificial Intelligence (ECAI 2004). pp. 298–302. IOS Press (2004)

    Google Scholar 

  14. Cote, R., Rothwell, D., Palotay, J., Beckett, R., Brochu, L.: The systematized nomenclature of human and veterinary medicine. Tech. rep., SNOMED International, Northfield, IL: College of American Pathologists (1993)

    Google Scholar 

  15. Eiter, T., Gottlob, G.: Identifying the minimal transversals of a hypergraph and related problems. Tech. Rep. CD-TR 91/16, Christian Doppler Laboratory for Expert Systems, TU Vienna (1991)

    Google Scholar 

  16. Gallo, G., Longo, G., Pallottino, S.: Directed hypergraphs and applications. Discrete Applied Mathematics 42(2), 177–201 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  17. Johnson, D.S., Yannakakis, M., Papadimitriou, C.H.: On generating all maximal independent sets. Information Processing Letters 27(3), 119–123 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  18. Kalyanpur, A., Parsia, B., Horridge, M., Sirin, E.: Finding all justifications of OWL DL entailments. In: Aberer, K., et al. (eds.) ASWC 2007 and ISWC 2007. LNCS, vol. 4825, pp. 267–280. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  19. Kazakov, Y.: Consequence-driven reasoning for Horn SHIQ ontologies. In: Boutilier, C. (ed.) Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI 2009), pp. 2040–2045 (2009)

    Google Scholar 

  20. Kazakov, Y., Krötzsch, M., Simančík, F.: The incredible ELK: From polynomial procedures to efficient reasoning with \(\mathcal{EL}\) ontologies. Journal of Automated Reasoning 53, 1–61 (2014)

    MathSciNet  Google Scholar 

  21. Lapaugh, A.S., Papadimitriou, C.H.: The even-path problem for graphs and digraphs. Networks 14(4), 507–513 (1984), http://dx.doi.org/10.1002/net.3230140403

    Article  MathSciNet  MATH  Google Scholar 

  22. Lembo, D., Lenzerini, M., Rosati, R., Ruzzi, M., Savo, D.F.: Inconsistency-tolerant semantics for description logics. In: Hitzler, P., Lukasiewicz, T. (eds.) RR 2010. LNCS, vol. 6333, pp. 103–117. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  23. Lin, L., Jiang, Y.: The computation of hitting sets: Review and new algorithms. Information Processing Letters 86(4), 177–184 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  24. Ludwig, M.: Just: A tool for computing justifications w.r.t. \(\mathcal{E{\kern-.1em}L}\) ontologies. In: Proceedings of the 3rd International Workshop on OWL Reasoner Evaluation, ORE 2014 (2014)

    Google Scholar 

  25. Ludwig, M., Peñaloza, R.: Error-tolerant reasoning in the description logic \(\mathcal{E{\kern-.1em}L}\). LTCS-Report 14-11, Chair of Automata Theory, Institute of Theoretical Computer Science, Technische Universität Dresden, Dresden, Germany (2014), see http://lat.inf.tu-dresden.de/research/reports.html .

  26. Peñaloza, R., Sertkaya, B.: Complexity of axiom pinpointing in the DL-Lite family of description logics. In: Coelho, H., Studer, R., Wooldridge, M. (eds.) Proceedings of the 19th European Conference on Artificial Intelligence (ECAI 2010). Frontiers in Artificial Intelligence and Applications, vol. 215, pp. 29–34. IOS Press (2010)

    Google Scholar 

  27. Peñaloza, R., Sertkaya, B.: On the complexity of axiom pinpointing in the \(\mathcal{E{\kern-.1em}L}\) family of description logics. In: Lin, F., Sattler, U., Truszczynski, M. (eds.) Proceedings of the Twelfth International Conference on Principles of Knowledge Representation and Reasoning (KR 2010). AAAI Press (2010)

    Google Scholar 

  28. Peñaloza, R.: Axiom-Pinpointing in Description Logics and Beyond. Ph.D. thesis, Dresden University of Technology, Germany (2009)

    Google Scholar 

  29. Reiter, R.: A theory of diagnosis from first principles. Artificial Intelligence 32(1), 57–95 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  30. Rosati, R.: On the complexity of dealing with inconsistency in description logic ontologies. In: Walsh, T. (ed.) Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI 2011), pp. 1057–1062. AAAI Press (2011)

    Google Scholar 

  31. Spackman, K.: Managing clinical terminology hierarchies using algorithmic calculation of subsumption: Experience with SNOMED-RT. Journal of the American Medical Informatics Association (2000); fall Symposium Special Issue

    Google Scholar 

  32. W3C OWL Working Group: OWL 2 web ontology language document overview. W3C Recommendation (2009), http://www.w3.org/TR/owl2-overview/

Download references

Author information

Authors and Affiliations

  1. Theoretical Computer Science, TU Dresden, Germany

    Michel Ludwig & Rafael Peñaloza

  2. Center for Advancing Electronics Dresden, Germany

    Michel Ludwig & Rafael Peñaloza

Authors
  1. Michel Ludwig
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rafael Peñaloza
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Madeira, Funchal, Madeira, Portugal

    Eduardo Fermé

  2. CENTRIA, Universidade Nova de Lisboa, Caparica, Portugal

    João Leite

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Ludwig, M., Peñaloza, R. (2014). Error-Tolerant Reasoning in the Description Logic \(\mathcal{E{\kern-.1em}L}\) . In: Fermé, E., Leite, J. (eds) Logics in Artificial Intelligence. JELIA 2014. Lecture Notes in Computer Science(), vol 8761. Springer, Cham. https://doi.org/10.1007/978-3-319-11558-0_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-11558-0_8

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-11557-3

  • Online ISBN: 978-3-319-11558-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation