# Rational Closure in SHIQ

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

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 8 Jun 2014.

## Built on by (most cited first, 1 of 1)

- [Exploring Values in Museum Artifacts in the SPICE project: a Preliminary Study](https://mlsanity.com/paper/2311.07396/) (2023)

## Abstract (arXiv)

We define a notion of rational closure for the logic SHIQ, which does not enjoys the finite model property, building on the notion of rational closure introduced by Lehmann and Magidor in [23]. We provide a semantic characterization of rational closure in SHIQ in terms of a preferential semantics, based on a finite rank characterization of minimal models. We show that the rational closure of a TBox can be computed in EXPTIME using entailment in SHIQ.