Abstract
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 [24]. 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.
| Lingua originale | Inglese |
|---|---|
| pagine (da-a) | 543-555 |
| Numero di pagine | 13 |
| Rivista | CEUR Workshop Proceedings |
| Volume | 1193 |
| Stato di pubblicazione | Pubblicato - 2014 |
| Evento | 27th International Workshop on Description Logics, DL 2014 - Vienna, Austria Durata: 17 lug 2014 → 20 lug 2014 |
Fingerprint
Entra nei temi di ricerca di 'Rational closure in SHIQ'. Insieme formano una fingerprint unica.Cita questo
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver