Computing the Least Common Subsumer in the Description Logic EL w.r.t. Terminological Cycles with Descriptive Semantics

@inproceedings{Baader2003ComputingTL,
  title={Computing the Least Common Subsumer in the Description Logic EL w.r.t. Terminological Cycles with Descriptive Semantics},
  author={Franz Baader},
  booktitle={ICCS},
  year={2003}
}
Computing the least common subsumer (lcs) is one of the most prominent non-standard inference in description logics. Baader, Küsters, and Molitor have shown that the lcs of concept descriptions in the description logic EL always exists and can be computed in polynomial time. In the present paper, we try to extend this result from concept descriptions to concepts defined in a (possibly cyclic) EL-terminology interpreted with descriptive semantics, which is the usual first-order semantics for… CONTINUE READING