Proceedings of the AAAI Conference on Artificial Intelligence · 2014 · 26 citations · 20 references
ComputingComputer ScienceAlgorithmsKnowledge RepresentationLogicDescription LogicsFormal OntologyOntology DesignOntology EngineeringComplexityDecision ProblemsNecessityOntologiesOntology FormalizationOntology ReasoningOntology RepairPreference Relations
In this paper we consider the problem of repairing missing is-a relations in ontologies. We formalize the problem as a generalized TBox abduction problem (GTAP). Based on this abduction framework, we present complexity results for the existence, relevance and necessity decision problems for the GTAP with and without some specific preference relations for ontologies that can be represented using a member of the EL family of description logics. Further, we present algorithms for finding solutions, a system as well as experiments.
20
Gene Ontology: tool for the unification of biology
Michael Ashburner, Catherine A. Ball, Judith A. Blake et al. · Nature Genetics · 2000 · 44.6K citations · Full text
Automatic acquisition of hyponyms from large text corpora
Marti A. Hearst · 1992 · 3.3K citations · Full text
Franz Baader, Sebastian Brandt, Carsten Lutz · 2005 · 869 citations · Full text
The complexity of logic-based abduction
Thomas Eiter, Georg Gottlob · Journal of the ACM · 1995 · 428 citations · Full text
Ontology change: classification and survey
Giorgos Flouris, Dimitris Manakanatas, Haridimos Kondylakis et al. · The Knowledge Engineering Review · 2008 · 270 citations