A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is
The EL subsumption hierarchy consists of all EL concept descriptions and is partially ordered by subsumption. In order to navigate within this hierarchy, one can go up to subsumers and down to subsumees. We analyze how smallest steps can be made. Specifically, we show how all upper neighbors as well as all lower neighbors of a given EL concept description can be efficiently computed, where two concepts are neighbors if one subsumes the other and there is no third concept in between. We furtherdblp:conf/dlog/Kriegel21 fatcat:rftswbz2qnb4xa7i2viy6gmi4y