An efficient approach to debugging ontologies based on patterns

15Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Ji, Q., Gao, Z., Huang, Z., & Zhu, M. (2012). An efficient approach to debugging ontologies based on patterns. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7185 LNCS, pp. 425–433). https://doi.org/10.1007/978-3-642-29923-0_33

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free