Finding all justifications of OWL DL entailments

  • Authors:
  • Aditya Kalyanpur;Bijan Parsia;Matthew Horridge;Evren Sirin

  • Affiliations:
  • IBM Watson Research Center, Hawthorne, NY;School of Computer Science, University of Manchester, UK;School of Computer Science, University of Manchester, UK;Clark & Parsia LLC, Washington, DC

  • Venue:
  • ISWC'07/ASWC'07 Proceedings of the 6th international The semantic web and 2nd Asian conference on Asian semantic web conference
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Finding the justifications of an entailment (that is, all the minimal set of axioms sufficient to produce an entailment) has emerged as a key inference service for the Web Ontology Language (OWL). Justifications are essential for debugging unsatisfiable classes and contradictions. The availability of justifications as explanations of entailments improves the understandability of large and complex ontologies. In this paper, we present several algorithms for computing all the justifications of an entailment in an OWL-DL Ontology and show, by an empirical evaluation, that even a reasoner independent approach works well on real ontologies.