2 search results - page 1 / 1 » Role-depth Bounded Least Common Subsumers by Completion for ... |
DLOG
2010
13 years 2 months ago
2010
The least common subsumer (lcs) w.r.t general EL-TBoxes does not need to exists in general due to cyclic axioms. In this paper we present an algorithm for computing role-depth boun...
DLOG
2011
12 years 8 months ago
2011
Completion algorithms for subsumption are investigated for many extensions of the description logic EL. While for several of them subsumption is tractable, this is no longer the ca...