Defeasible reasoning in Description Logics: an overview on DL^N
This work addresses defeasible reasoning in description logics for knowledge engineering, but it is incremental as it builds on existing approaches.
The paper tackles the problem of extending description logics with defeasible reasoning by providing an overview of DL^N, highlighting its features that avoid common semantic and computational issues, and comparing it with alternative nonmonotonic semantics to relate it to KLM postulates.
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.