In nonmonotonic reasoning conflicts among defaults are ubiquitous. In this talk I will present a principled account to deal with them. I will do so in two ways: semantically, within a circumscriptive theory, and syntactically by supplying an algorithm for inheritance networks. The latter is sound and complete with respect to the first.