Defeasible reasoning in Description Logics: an overview on DL^N

TL;DR

This paper provides an overview of DL^N, a recent extension of description logics with defeasible reasoning, discussing its features, knowledge engineering aspects, and comparisons with other nonmonotonic semantics.

Contribution

It introduces DL^N, highlighting its unique features, knowledge requirements, and its relationship with KLM postulates, addressing previous semantic and computational issues.

Findings

DL^N preserves key description logic properties.

DL^N aligns with KLM nonmonotonic reasoning postulates.

Comparison shows DL^N's advantages over alternative semantics.

Abstract

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.