Decomposition-based Reasoning for Large Knowledge Bases in Description Logics - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Integrated Computer-Aided Engineering Année : 2008

Decomposition-based Reasoning for Large Knowledge Bases in Description Logics

Résumé

Reasoning in a Knowledge Base (KB) is one of the most important applications of Description Logic (DL) reasoners. The execution time and storage space requirements are both significant factors that directly influence the performance of a reasoning algorithm. In this paper, we investigate a new technique for optimizing DL reasoning in order to minimize the above two factors as much as possible. This technique is applied to speed up TBox and ABox reasoning, especially for large TBoxes. The incorporation of this technique with previous optimization techniques in current DL systems can effectively solve intractable inferences. Our technique is called "overlap ontology decomposition", in which the decomposition of a given ontology into many sub-ontologies is implemented such that the semantics and inference services of the original ontology are preserved. We are concerned about how to reason effectively with multiple KBs and how to improve the efficiency of reasoning over component ontologies.
Fichier principal
Vignette du fichier
Article-ICAE-V5.pdf (286.68 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01516223 , version 1 (29-04-2017)

Identifiants

  • HAL Id : hal-01516223 , version 1

Citer

Thi Anh Le Pham, Nhan Le Thanh, Peter Sander. Decomposition-based Reasoning for Large Knowledge Bases in Description Logics. Integrated Computer-Aided Engineering, 2008, 15 (1), pp.53-70. ⟨hal-01516223⟩
140 Consultations
148 Téléchargements

Partager

Gmail Facebook X LinkedIn More