  DL^N is a recent approach that extends description logics with defeasible
reasoning capabilities. In this paper we provide an overview on DL^N,
illustrating the underlying knowledge engineering requirements as well as the
characteristic features that preserve DL^N from some recurrent semantic and
computational drawbacks. We also compare DL^N with some alternative
nonmonotonic semantics, enlightening the relationships between the KLM
postulates and DL^N.
