@inproceedings{670b3c55a1444b8790c97f2237afa411,
title = "Finding all justifications of OWL DL entailments",
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. {\textcopyright} 2008 Springer-Verlag Berlin Heidelberg.",
keywords = "Debugging, Justifications, OWL ontology explanation",
author = "Aditya Kalyanpur and Bijan Parsia and Matthew Horridge and Evren Sirin",
year = "2007",
doi = "10.1007/978-3-540-76298-0\_20",
language = "English",
isbn = "3540762973",
volume = "4825",
series = "Lecture Notes in Computer Science",
publisher = "Springer Nature",
pages = "267--280",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|Lect. Notes Comput. Sci.",
address = "United States",
note = "6th International Semantic Web Conference, ISWC 2007 and 2nd Asian Semantic Web Conference, ASWC 2007 ; Conference date: 01-07-2007",
}