Reasoning on $\textit{DL-Lite}_{\cal R}$ with Defeasibility in ASP
Loris Bozzato, Thomas Eiter, Luciano Serafini

TL;DR
This paper extends defeasible reasoning with exceptions to $ extit{DL-Lite}_{ ext{R}}$, providing a simpler ASP-based reasoning method for knowledge bases in this logic, especially for instance checking.
Contribution
It introduces a novel approach for reasoning with defeasible axioms in $ extit{DL-Lite}_{ ext{R}}$, simplifying ASP encoding and enabling complete reasoning procedures.
Findings
Simplified ASP encoding for $ extit{DL-Lite}_{ ext{R}}$ with defeasible axioms
Complete reasoning procedure for instance checking
Analysis of exceptions over unnamed individuals
Abstract
Reasoning on defeasible knowledge is a topic of interest in the area of description logics, as it is related to the need of representing exceptional instances in knowledge bases. In this direction, in our previous works we presented a framework for representing (contextualized) OWL RL knowledge bases with a notion of justified exceptions on defeasible axioms: reasoning in such framework is realized by a translation into ASP programs. The resulting reasoning process for OWL RL, however, introduces a complex encoding in order to capture reasoning on the negative information needed for reasoning on exceptions. In this paper, we apply the justified exception approach to knowledge bases in , i.e., the language underlying OWL QL. We provide a definition for knowledge bases with defeasible axioms and study their semantic and computational…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
