Defeasible reasoning in Description Logics: an overview on

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