A theory of diagnosis from first principles
Artificial Intelligence
First-order logic and automated theorem proving (2nd ed.)
First-order logic and automated theorem proving (2nd ed.)
WWW '05 Proceedings of the 14th international conference on World Wide Web
Pellet: A practical OWL-DL reasoner
Web Semantics: Science, Services and Agents on the World Wide Web
A Resolution-Based Decision Procedure for $\boldsymbol{\mathcal{SHOIQ}}$
Journal of Automated Reasoning
Computing minimum cost diagnoses to repair populated DL-based ontologies
Proceedings of the 17th international conference on World Wide Web
A Modularization-Based Approach to Finding All Justifications for OWL DL Entailments
ASWC '08 Proceedings of the 3rd Asian Semantic Web Conference on The Semantic Web
Non-standard reasoning services for the debugging of description logic terminologies
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Goal-Directed Module Extraction for Explaining OWL DL Entailments
ISWC '09 Proceedings of the 8th International Semantic Web Conference
A framework for handling inconsistency in changing ontologies
ISWC'05 Proceedings of the 4th international conference on The Semantic Web
Towards a complete OWL ontology benchmark
ESWC'06 Proceedings of the 3rd European conference on The Semantic Web: research and applications
A method of contrastive reasoning with inconsistent ontologies
JIST'11 Proceedings of the 2011 joint international conference on The Semantic Web
Hi-index | 0.00 |
Ontology debugging plays an important role in tackling inconsistency in OWL DL ontologies. It computes all minimal inconsistent sub-ontologies (MISs) of an inconsistent ontology. However, the computation of all MISs is costly. Existing module extraction methods that optimize the debugging of ontology entailments are not sufficient to optimize the computation of all MISs, because a module (i.e. a sub-ontology) that covers all MISs can be too large to be handled by existing OWL DL debugging facilities. In order to generate smaller sub-ontologies, we propose a novel method for computing a set of sub-ontologies from an inconsistent OWL DL ontology so that the computation of all MISs can be separately performed in each resulting sub-ontology and the union of computational results yields exactly the set of all MISs. Experimental results show that this method significantly improves the scalability for computing all MISs of an inconsistent ontology.