HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Journal articles

Semantic characterization of rational closure: From propositional logic to description logics

Abstract : In this paper we provide a semantic reconstruction of rational closure. We first consider rational closure as defined by Lehman and Magidor [33] for propositional logic, and we provide a semantic characterization based on a minimal models mechanism on rational models. Then we extend the whole formalism and semantics to Description Logics, by focusing our attention to the standard ACC: we first naturally adapt to Description Logics Lehman and Magidor's propositional rational closure, starting from an extension of ACC with a typicality operator T that selects the most typical instances of a concept C (hence T(C) stands for typical C). Then, for the Description Logics, we define a minimal model semantics for the logic ACC and we show that it provides a semantic characterization for the rational closure of a Knowledge base. We consider both the rational closure of the TBox and the rational closure of the ABox
Document type :
Journal articles
Complete list of metadata

https://hal-amu.archives-ouvertes.fr/hal-01479541
Contributor : William Domingues Vinhas Connect in order to contact the contributor
Submitted on : Tuesday, February 28, 2017 - 8:38:51 PM
Last modification on : Wednesday, February 16, 2022 - 3:00:58 PM

Links full text

Identifiers

Citation

Laura Giordano, Valentina Gliozzi, Nicola Olivetti, Gian Pozzato. Semantic characterization of rational closure: From propositional logic to description logics. Artificial Intelligence, Elsevier, 2015, 226, pp.1-33. ⟨10.1016/j.artint.2015.05.001⟩. ⟨hal-01479541⟩

Share

Metrics

Record views

35