Abstract
We introduce a notion of rational closure for the logic SHIQ based on the well-known rational closure by Lehmann and Magidor [21]. 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.
Lingua originale | Inglese |
---|---|
pagine (da-a) | 271-277 |
Numero di pagine | 7 |
Rivista | CEUR Workshop Proceedings |
Volume | 1231 |
Stato di pubblicazione | Pubblicato - 2014 |
Evento | 15th Italian Conference on Theoretical Computer Science, ICTCS 2014 - Perugia, Italy Durata: 17 set 2014 → 19 set 2014 |