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

2020/09/10 by Piero A. Bonatti, Bonatti, Piero A., Iliana M. Petrova +3
Computer Science · #Advanced Database Systems and Queries #Artificial Intelligence (cs.AI) #FOS: Computer and information sciences #Logic, Reasoning, and Knowledge #Semantic Web and Ontologies

paper · pdf · doi:10.48550/arxiv.2009.04978

openalex publication_date 2020/09/10 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Citations

• Optimizing the computation of overriding

Related

• Theoretical Foundations of Defeasible Description Logics
• Which are the True Defeasible Logics?
• Approximating Defeasible Logics to Improve Scalability
• Interdefinability of defeasible logic and logic programming under the well-founded semantics
• A flexible framework for defeasible logics