Revision of prioritized $$\mathcal {E}\mathcal {L}$$ ontologies
Résumé
In this paper, we investigated the evolution of prioritized EL ontologies in the presence of new information that can be certain or uncertain. We propose an extension of EL description logic, named EL + ⊥ , within possibility theory to encode such knowledge. This extension provides a natural way to deal with the ordinal scale and represent knowledge in a way that can handle incomplete information and conflicting data. We provided a polynomial algorithm for computing the possibilistic entailment. Then, we defined the evolution process at the semantic and syntactic levels. Interestingly enough, we show that the syntactical algorithm is done in polynomial time.
Fichier principal
_Applied_Intelligence__Revision_of_Prioritized_EL_ontologies.pdf (651.39 Ko)
Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)