Skip to Main content Skip to Navigation
Journal articles

Decomposing ontology in Description Logics by graph partitioning

Abstract : In this paper, we investigate the problem of decomposing an ontology in Description Logics (DLs) based on graph partitioning algorithms. Also, we focus on syntax features of axioms in a given ontology. Our approach aims at decomposing the ontology into many sub ontologies that are as distinct as possible. We analyze the algorithms and exploit parameters of partitioning that influence the efficiency of computation and reasoning. These parameters are the number of concepts and roles shared by a pair of sub-ontologies, the size (the number of axioms) of each sub-ontology, and the topology of decomposition. We provide two concrete approaches for automatically decomposing the ontology, one is called minimal separator based partitioning, and the other is eigenvectors and eigenvalues based segmenting. We also tested on some parts of used TBoxes in the systems FaCT, Vedaall, tambis, ... and propose estimated results.
Complete list of metadata

Cited literature [8 references]  Display  Hide  Download
Contributor : Nhan Le Thanh <>
Submitted on : Sunday, January 29, 2017 - 6:23:59 PM
Last modification on : Monday, October 12, 2020 - 10:30:41 AM
Long-term archiving on: : Sunday, April 30, 2017 - 12:11:22 PM


Files produced by the author(s)


  • HAL Id : hal-01448901, version 1


Thi Le Pham, Nhan Le Thanh, Minh Nguyen. Decomposing ontology in Description Logics by graph partitioning. Asian International Journal of Science and Technology in Production and Manufacturing Engineering, King Mongkut's University of Technology North Bangkok, 2012, 5 (3), pp.57-65. ⟨hal-01448901⟩



Record views


Files downloads