Defeasible reasoning in Description Logics: an overview on $\mathcal{DL}^\mathrm{N}$

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