Completion-based algorithms can be employed for computing the least common subsumer of two concepts up to a given role-depth, in extensions of the lightweight DL EL. This approach has been applied also to the probabilistic DL Prob-EL, which is variant of EL with subjective probabilities. In this paper we extend the completion-based lcscomputation algorithm to nominals, yielding a procedure for ...

Methods for computing the least common subsumer (lcs) are usually restricted to rather inexpressive DLs whereas existing knowledge bases are written in very expressive DLs. In order to allow the user to re-use concepts defined in such terminologies and still support the definition of new concepts by computing the lcs, we extend the notion of the lcs of concept descriptions to the notion of the ...

By a theorem of Dobrow and Smythe, the depth of the kth node in very simple families of increasing trees (which includes, among others, binary increasing trees, recursive trees and plane ordered recursive trees) follows the same distribution as the number of edges of the form j−(j+1) with j < k. In this short note, we present a simple bijective proof of this fact, which also shows that the resu...

The Least Common Ancestor Problem can be used to solve many other algorithmic problems on trees. It is shown that an efficient and simple solution is possible.

Computing the least common subsumer (lcs) has proved to be useful in a variety of different applications. Previous work on the lcs has concentrated on description logics that either allow for number restrictions or for existential restrictions. Many applications, however, require to combine these constructors. In this work, we present an lcs algorithm for the description logic ALEN , which allo...

Computing least common subsumers in description logics is an important reasoning service useful for a number of applications. As shown in the literature, this reasoning service can be used for the approximation of concept disjunctions in description logics, the \bottom-up" construction of knowledge bases, learning tasks, and for speciic kinds of information retrieval. So far, computing the leas...

As the fuzzy data management has become one of the main research topics and directions, the question of how to obtain the useful information by means of keyword query from fuzzy XML documents is becoming a subject of an increasing needed investigation. Considering the keyword query methods on crisp XML documents, smallest lowest common ancestor (SLCA) semantics is one of the most widely accepte...

We present in this paper novel techniques that determine the semantic relationships among genes and gene products. We implemented these techniques in a middleware system called GOtoGene, which resides between user application and Gene Ontology database. Given a set S of genes, GOtoGene would return another set S  of genes, where each gene in S  is semantically related to each gene in S . The ...

The present study was conducted to investigate the effects of various pectin to cellules ratios on carcass characteristics and visceral organs of broiler chickens. A total of 400 chickens were allocated to 4 treatments, 4 replications and 25 chickens in each at a completely randomize design. Treatments were consisted of control (treatment 1) or diets containing different pectin: cellulose ratio...