Some approaches of ontology Decomposition in Description Logics
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 partitioning based on minimal separator, and the other is segmenting based on eigenvectors and eigenvalues.
KeywordsGraph partitioning ontology decomposition image segmentation
Unable to display preview. Download preview PDF.
- 1.Dieter Jungnickel, Graphs, Networks and Algorithms. Springer 1999.Google Scholar
- 4.Thi Anh Le Pham and Nhan Le Thanh, Decomposition-Based Reasoning for Large Knowledge Bases in Description Logics. In Proceedings of the 13th ISPE International Conference on Concurrent Engineering: Research and Applications, p. 288–295, Antibles, France, September 2006 Google Scholar
- 5.Kirill Shoikhet and Dan Geiger, Finding optimal triangulations via minimal vertex separators. In Proceedings of the 3rd International Conference, p. 270–281, Cambridge, MA, October 1992.Google Scholar
- 6.T. Kloks and D. Kratsch, Listing all minimal separators of a graph. In Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science, Spinger, Lecture Notes in Computer Science, 775, pp.759–768.Google Scholar
- 7.Thi Anh LePham, Raisonnement sur des ontologies décomposées. Rapport de recherche, Lab I3S, Université de Nice-Sophia Antipolis, 2006.Google Scholar