In this talk, a connection calculus for the description logic (DL) ALC is presented. First, the classical FOL connection calculus will be introduced; and briefly the description logic ALC as well. Then, the new ALC calculus will be presented. It replaces the usage of Skolem terms and unification by additional annotation and introduces blocking, a typical feature of DL provers, by a new rule, to ensure termination in the case of cyclic ontologies. Besides the connection calculus, a simplified clausal form normalization is presented