Computing the Least Common Subsumer w.r.t. a Background Terminology

Franz BaaderFranz Baader, B. SertkayaB. Sertkaya, Anni-Yasmin TurhanAnni-Yasmin Turhan

Download

Franz Baader, B. Sertkaya, Anni-Yasmin Turhan
Computing the Least Common Subsumer w.r.t. a Background Terminology
In José Júlio Alferes and João Alexandre Leite, eds., Proceedings of the 9th European Conference on Logics in Artificial Intelligence (JELIA 2004), volume 3229 of Lecture Notes in Computer Science, 400-412, 2004. Springer

Details
Bibtex

KurzfassungAbstract
Methods for computing the least common subsumer (lcs) are usually restricted to rather inexpressive Description Logics (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 lcs w.r.t. a background terminology. We will both show a theoretical result on the existence of the least common subsumer in this setting, and describe a practical approach (based on a method from formal concept analysis) for computing good common subsumers, which may, however, not be the least ones.
Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory

The final publication is available at Springer.

@inproceedings{ BaaderSertkayaTurhan04,
  address = {Lisbon, Portugal},
  author = {F. {Baader} and B. {Sertkaya} and A.-Y. {Turhan}},
  booktitle = {Proceedings of the 9th European Conference on Logics in Artificial Intelligence {(JELIA 2004)}},
  editor = {Jos{\'e} J{\'u}lio {Alferes} and Jo{\~a}o Alexandre {Leite}},
  pages = {400--412},
  publisher = {Springer-Verlag},
  series = {Lecture Notes in Computer Science},
  title = {Computing the Least Common Subsumer w.r.t.\ a Background Terminology},
  volume = {3229},
  year = {2004},
}