Abstract [Fages, 1994] introduces the notion of wellsupportedness as a key requirement for the semantics of normal logic programs and characterizes the standard answer set semantics in terms of the well-supportedness condition. With the property of well-supportedness, answer sets are guaranteed to be free of circular justi?cations. In this paper, we extend Fages’ work to description logic programs (or DL-programs). We introduce two forms of well-supportedness for DL-programs. The ?rst one de?nes weakly well-supported models that are free of circular justi?cations caused by positive literals in rule bodies. The second one de?nes strongly well-supported models that are free of circular justi?cations caused by either positive or negative literals. We then de?ne two new answer set semantics for DL-programs and characterize them in terms of the weakly and strongly well-supported models, respectively. The ?rst semantics is based on an extended Gelfond-Lifschitz transformation and de?nes weakly well-supported answer sets that are free of circular justi?cations for the class of DL-programs without negative dlatoms. The second semantics de?nes strongly wellsupported answer sets which are free of circular justi?cations for all DL-programs. We show that the existing answer set semantics for DL-programs, such as the weak answer set semantics, the strong answer set semantics, and the FLP-based answer set semantics, satisfy neither the weak nor the strong well-supportedness condition, even for DLprograms without negative dl-atoms. This explains why their answer sets incur circular justi?cations.