Declaration of Authorship I

Generalizations of a collection of concepts can be computed by the least common subsumer (lcs) which is a useful inference for building knowledge bases. For general FL0-TBoxes the lcs need not exist. In this thesis, we devise a condition to check whether a concept is the lcs of two concepts w.r.t. a general FL0-TBox. We also define the characterizations for the existence of the lcs. Last, we show that if the lcs exists, then we can compute the lcs and the upper bound for the role-depth of the lcs. Declaration of Authorship I, Adrian Nuradiansyah of Technische Universität Dresden, being a candidate of Master of Science in Computational Logic, hereby declare that this thesis is my own work. Any help that I have received in my research work has been acknowledged. I certify that I have not used any auxiliary sources and literature except those cited in the thesis. Author : Adrian Nuradiansyah Matriculation Number : 4108192 Title : Algorithms for Computing Least Common Subsumers in General FL0-TBox