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 bounded EL-lcs based on the completion algorithm for EL. We extend this computation algorithm to a recently introduced probabilistic variant of EL: Prob-EL.

We care not only about the value of the minimum element, but also about the index k of the minimum element between A[i] and A[j]; given the index, it is easy to look up the actual value of the minimum element, so it is a more interesting problem to find the index of the minimum element between A[i] and A[j]. The range minimum query problem is not a tree problem, but it closely related to a tree...

0

In this study, effect of increasing temperature on life cycle, mortality, and behavior the mosquito species, Aedes aegypti was evaluated. Heat shock applied at 32°C, 37°C 42°C for 20 minutes, 1 hour 2 hours each to egg, 2nd instar, 3rd instar pupal stage separately changes in cycle pattern recorded a routine basis. The control 27°C which reared. When heat-shock eggs, developmental period found ...

Adhesions after abdomino-pelvic surgery are a cause of morbidity and reoperations. The use of human amniotic membrane (HAM) for adhesion prevention has given controversial results. The mode of administration of the amniotic membrane has not been well studied. This study assessed the efficacy of two modes of application of cryopreserved HAM, patch or fragmented in Lactated Ringer (LR) solution, ...

Computing least common subsumers in description logics is an important reasoning service useful for a number of applications. As shown in the literature, it can, for instance, be used for similarity-based information retrieval where information retrieval is performed on the basis of the similarities of user-specified examples. In this article, we first show that, for crisp DLs, in certain cases...

Fitch graphs G = (X,E) are di-graphs that are explained by {⊗, 1}-edge-labeled rooted trees with leaf set X: there is an arc xy ∈ E if and only if the unique path in T that connects the least common ancestor lca(x, y) of x and y with y contains at least one edge with label 1. In practice, Fitch graphs represent xenology relations, i.e., pairs of genes x and y for which a horizontal gene transfe...

For EL the least common subsumer (lcs) need not exist, if computed w.r.t. general TBoxes. In case the role-depth of the lcs concept description is bounded, an approximate solution can be obtained. In this paper we extend the completion-based method for computing such approximate solutions to ELI and EL+. For ELI the extension needs to be able to treat complex node labels. For EL+ a naive method...