2014/06/08 by Laura Giordano, Giordano, Laura, Valentina Gliozzi +5
Computer Science · #Artificial Intelligence (cs.AI) #FOS: Computer and information sciences #Logic, Reasoning, and Knowledge #Logic, programming, and type systems #Semantic Web and Ontologies #cs.AI
paper · pdf · doi:10.48550/arxiv.1406.2023
30 pages, extended version of paper accepted to DL2014
arxiv created 2014/06/08 · openalex publication_date 2014/06/08 · arxiv updated 2014/06/10 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.