# A Note on Reasoning on $\textit{DL-Lite}_{\cal R}$ with Defeasibility

## TL;DR

This paper introduces a simplified reasoning approach for defeasible axioms in DL-Lite_R, enabling efficient instance checking through a datalog encoding under answer set semantics.

## Contribution

It defines defeasible axioms in DL-Lite_R and develops a straightforward datalog-based reasoning method for instance checking.

## Key findings

- Provides a complete reasoning procedure for defeasible DL-Lite_R
- Simplifies reasoning by encoding negative information directly
- Enables efficient instance checking in defeasible DL-Lite_R

## Abstract

Representation of defeasible information is of interest in description logics, as it is related to the need of accommodating exceptional instances in knowledge bases. In this direction, in our previous works we presented a datalog translation for reasoning on (contextualized) OWL RL knowledge bases with a notion of justified exceptions on defeasible axioms. While it covers a relevant fragment of OWL, the resulting reasoning process needs a complex encoding in order to capture reasoning on negative information. In this paper, we consider the case of knowledge bases in $\textit{DL-Lite}_{\cal R}$, i.e. the language underlying OWL QL. We provide a definition for $\textit{DL-Lite}_{\cal R}$ knowledge bases with defeasible axioms and study their properties. The limited form of $\textit{DL-Lite}_{\cal R}$ axioms allows us to formulate a simpler encoding into datalog (under answer set semantics) with direct rules for reasoning on negative information. The resulting materialization method gives rise to a complete reasoning procedure for instance checking in $\textit{DL-Lite}_{\cal R}$ with defeasible axioms.