A Structure-preserving Clause Form Translation
Journal of Symbolic Computation
A theory of diagnosis from first principles
Artificial Intelligence
The description logic handbook: theory, implementation, and applications
The description logic handbook: theory, implementation, and applications
WWW '05 Proceedings of the 14th international conference on World Wide Web
Just the right amount: extracting modules from ontologies
Proceedings of the 16th international conference on World Wide Web
Laconic and Precise Justifications in OWL
ISWC '08 Proceedings of the 7th International Conference on The Semantic 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
Inconsistencies, negations and changes in ontologies
AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
Non-standard reasoning services for the debugging of description logic terminologies
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Finding all justifications of OWL DL entailments
ISWC'07/ASWC'07 Proceedings of the 6th international The semantic web and 2nd Asian conference on Asian semantic web conference
Debugging OWL-DL ontologies: a heuristic approach
ISWC'05 Proceedings of the 4th international conference on The Semantic Web
Text2Onto: a framework for ontology learning and data-driven change discovery
NLDB'05 Proceedings of the 10th international conference on Natural Language Processing and Information Systems
Hi-index | 0.00 |
Ontology debugging helps users to understand the unsatisfiability of a concept in an ontology by finding minimal unsatisfiability-preserving sub-ontologies (MUPS) of the ontology for the concept. Although existing approaches have shown good performance for some real life ontologies, they are still inefficient to handle ontologies that have many MUPS for an unsatisfiable concept. In this paper, we propose an efficient approach to debugging ontologies based on a set of patterns. Patterns provide general information to explain unsatisfiability but are not dependent on a specific ontology. In this approach, we make use of a set of heuristic strategies and construct a directed graph w.r.t. the hierarchies where the depth-first search strategy can be used to search paths. The experiments show that our approach has gained a significant improvement over the state of the art and can find considerable number of MUPS.