Abstract
We provide a semantical reconstruction of rational closure. We first consider rational closure as defined by Lehman and Magidor for propositional logic, and we provide a semantical characterization based on minimal models mechanism on rational models. Then, we extend the whole formalism and semantics to Description Logics focusing our attention to the standard AℒC: we first naturally adapt to Description Logics Lehman and Magidor's propositional rational closure, starting from an extension of AℒC with a typicality operator T that selects the most typical instances of a concept C (hence T(C) stands for typical Cs). Then, we provide for AℒC plus T a semantical characterization similar to the one for propositional logic. Last, we extend the notion of rational closure to the ABox.
Lingua originale | Inglese |
---|---|
pagine (da-a) | 99-113 |
Numero di pagine | 15 |
Rivista | CEUR Workshop Proceedings |
Volume | 1068 |
Stato di pubblicazione | Pubblicato - 2013 |
Evento | 28th Italian Conference on Computational Logic, CILC 2013 - Catania, Italy Durata: 25 set 2013 → 27 set 2013 |