A proof theory for description logics introduces sequent calculi and natural deduction for some DLs (ALC, ALCQ). Cut-elimination and normalization are proved for the calculi. The author argues that such systems can improve the extraction of computational content from DLs proofs for explanation purposes.