Skip to Main content Skip to Navigation
Journal articles

Decomposition-based Reasoning for Large Knowledge Bases in Description Logics

Abstract : 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.
Complete list of metadatas

Cited literature [18 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01516223
Contributor : Nhan Le Thanh <>
Submitted on : Saturday, April 29, 2017 - 8:34:37 AM
Last modification on : Tuesday, May 26, 2020 - 6:50:29 PM
Document(s) archivé(s) le : Sunday, July 30, 2017 - 12:11:02 PM

File

Article-ICAE-V5.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01516223, version 1

Collections

Citation

Thi Le Pham, Nhan Le Thanh, Peter Sander. Decomposition-based Reasoning for Large Knowledge Bases in Description Logics. Integrated Computer-Aided Engineering, IOS Press, 2008, 15 (1), pp.53-70. ⟨hal-01516223⟩

Share

Metrics

Record views

160

Files downloads

225