# A Rational Entailment for Expressive Description Logics via Description Logic Programs

arXiv: https://arxiv.org/abs/2107.06075 · HTML: https://mlsanity.com/paper/2107.06075/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 2 of its 26 references that are in the map.
- First posted on arXiv 28 Jun 2021.

## Builds on (most cited first, 2 of 2)

- [A Polynomial Time Subsumption Algorithm for Nominal Safe ELO_bot under Rational Closure](https://mlsanity.com/paper/1802.08201/) (2018)
- [ASP for Minimal Entailment in a Rational Extension of SROEL](https://mlsanity.com/paper/1608.02450/) (2016)

## Abstract (arXiv)

Lehmann and Magidor's rational closure is acknowledged as a landmark in the field of non-monotonic logics and it has also been re-formulated in the context of Description Logics (DLs). We show here how to model a rational form of entailment for expressive DLs, such as SROIQ, providing a novel reasoning procedure that compiles a non-monotone DL knowledge base into a description logic program (dl-program).