This site uses cookies to deliver our services and to ensure you get the best experience. By continuing to use this site, you consent to our use of cookies and acknowledge that you have read and understand our Privacy Policy, Cookie Policy, and Terms
Transitive roles are important for adequate representation of knowledge in a range of applications. In this paper we present a first algorithm to compute least common subsumers in a description logic with transitive roles.