Finding all Justifications of OWL DL Entailments
A paper written by Evren Sirin, Aditya Kalyanpur, Bijan Parsia and Matthew Horridge. It was presented at the ISWC2007+ASWC2007.
[edit] 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.
A linked list of all papers is provided in the article on ISWC2007+ASWC2007 papers. This article has originally been created from the ISWC 2007/ASWC 2007 metadata.
