Skip to Main content Skip to Navigation
New interface
Conference papers

Decomposing ontology in Description Logics by graph partitioning

Thi-Anh-Le Pham 1 Nhan Le Thanh 1 
1 WIMMICS - Web-Instrumented Man-Machine Interactions, Communities and Semantics
CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - SPARKS - Scalable and Pervasive softwARe and Knowledge Systems
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 Connect in order to contact the contributor
Submitted on : Monday, April 2, 2012 - 2:42:31 PM
Last modification on : Thursday, August 4, 2022 - 4:54:55 PM
Long-term archiving on: : Tuesday, July 3, 2012 - 2:32:26 AM


Files produced by the author(s)


  • HAL Id : hal-00684542, version 1



Thi-Anh-Le Pham, Nhan Le Thanh. Decomposing ontology in Description Logics by graph partitioning. The 8 th International Conference on Computing and Information Technology (IC2IT 2012), KMUTNB University, May 2012, Pattaya City, Thailand. ⟨hal-00684542⟩



Record views


Files downloads