Completion algorithms for subsumption are investigated for many extensions of the description logic EL. While for several of them subsumption is tractable, this is no longer the case, if inverse roles are admitted. In this paper we present an optimized version of the completion algorithm for ELHIfR+ , which is implemented in jCel. The completion sets computed during classification are a good substrate for implementing other reasoning services such as generalizations. We report on an extension of jCel that computes role-depth bounded least common subsumers and most specific concepts based on completion sets.