Computing Least Common Subsumers in ALEN

@inproceedings{Ksters2001ComputingLC,
  title={Computing Least Common Subsumers in ALEN},
  author={Ralf K{\"u}sters and Ralf Molitor},
  booktitle={IJCAI},
  year={2001}
}
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… CONTINUE READING