Skip to main content
Springer Nature Link
Log in

Towards Explaining DL Non-entailments by Utilizing Subtree Isomorphisms

  • Conference paper
  • First Online:
Information Integration and Web Intelligence (iiWAS 2022)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 13635))

Included in the following conference series:

  • 820 Accesses

Abstract

We present our current state of research on explaining non-entailments by finding isomorphic subtrees of \(\mathcal{E}\mathcal{L}\)-description trees. Our approach extends the set of abducible axioms that consist only of concepts to role restrictions as well. We argue how our approach could find solutions to abduction problems in scenarios where other methods cannot, and illustrate this via an example comparing our approach to existing ones.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Schlobach, S., Cornet, R.: Non-standard reasoning services for the debugging of description logic terminologies. IJCAI 3, 355–362 (2003)

    Google Scholar 

  2. Kalyanpur, A.: Debugging and Repair of OWL Ontologies. University of Maryland, College Park (2006)

    Google Scholar 

  3. Kalyanpur, A., Parsia, B., Horridge, M., Sirin, E.: Finding all justifications of OWL DL entailments. In: Aberer, K., et al. (eds.) ASWC/ISWC -2007. LNCS, vol. 4825, pp. 267–280. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-76298-0_20

    Chapter  Google Scholar 

  4. Alrabbaa, C., Baader, F., Borgwardt, S., Koopmann, P., Kovtunova, A.: Finding small proofs for description logic entailments: theory and practice (Extended Technical Report) (2020) arXiv preprint arXiv:2004.08311

  5. Alrabbaa, C., Hieke, W., Turhan, A.Y.: Counter model transformation for explaining non-subsumption in EL. FCR@ KI pp. 9–22 (2021)

    Google Scholar 

  6. Du, J., Wan, H., Ma, H.: Practical TBox abduction based on justification patterns. In: AAAI, vol. 31(1), (2017)

    Google Scholar 

  7. Haifani, F., Koopmann, P., Tourret, S., Weidenbach, C.: Connection-Minimal Abduction in EL via Translation to FOL. Proc, IJCAR (2022)

    Book  Google Scholar 

  8. Calvanese, D., Ortiz, M., Simkus, M., Stefanoni, G.: Reasoning about explanations for negative query answers in DL-Lite. JAIR 48, 635–669 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  9. Koopmann, P.: Signature-based abduction with fresh individuals and complex concepts for description logics. Description Logics (2021)

    Google Scholar 

  10. Elsenbroich, C., Kutz, O., Sattler, U.: A Case for Abductive Reasoning over Ontologies. In: OWLED, vol. 216 (2006)

    Google Scholar 

  11. Koopmann, P., Del-Pinto, W., Tourret, S., Schmidt, R.A.: Signature-based abduction for expressive description logics. In: KR2020 17(1), pp. 592–602 (2020)

    Google Scholar 

  12. Baader, F., Küsters, R., Molitor, R.: Computing Least Common Subsumers in Description Logics with Existential Restrictions. In: IJCAI 99, pp. 96–101 (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Informatics, Aristotle University of Thessaloniki, 54124, Thessaloniki, Greece

    Ivan Gocev, Georgios Meditskos & Nick Bassiliades

Authors
  1. Ivan Gocev
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Georgios Meditskos
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Nick Bassiliades
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ivan Gocev .

Editor information

Editors and Affiliations

  1. La Trobe University, Melbourne, VIC, Australia

    Eric Pardede

  2. Monash University, Melbourne, VIC, Australia

    Pari Delir Haghighi

  3. Johannes Kepler University Linz, Linz, Austria

    Ismail Khalil

  4. Johannes Kepler University Linz, Linz, Austria

    Gabriele Kotsis

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Gocev, I., Meditskos, G., Bassiliades, N. (2022). Towards Explaining DL Non-entailments by Utilizing Subtree Isomorphisms. In: Pardede, E., Delir Haghighi, P., Khalil, I., Kotsis, G. (eds) Information Integration and Web Intelligence. iiWAS 2022. Lecture Notes in Computer Science, vol 13635. Springer, Cham. https://doi.org/10.1007/978-3-031-21047-1_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-21047-1_32

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-21046-4

  • Online ISBN: 978-3-031-21047-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics