Rational Closure in SHIQ
classification
💻 cs.AI
keywords
closurerationalshiqcharacterizationfinitenotionbuildingcomputed
read the original 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.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Molecular dynamic simulation of multicomponent CoCrFeNiMn high-entropy alloy thin film deposition
MD simulation of CoCrFeMnNi HEA thin film deposition on Al(100) using Morse potentials yields a 6.1 nm mixed-phase film whose structure matches experimental data.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.