Rational Closure in SHIQ
Artificial Intelligence
2014-06-10 v1
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 [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.
Cite
@article{arxiv.1406.2023,
title = {Rational Closure in SHIQ},
author = {Laura Giordano and Valentina Gliozzi and Nicola Olivetti and Gian Luca Pozzato},
journal= {arXiv preprint arXiv:1406.2023},
year = {2014}
}
Comments
30 pages, extended version of paper accepted to DL2014