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

Franz BaaderFranz Baader, Baris SertkayaBaris Sertkaya, Anni-Yasmin TurhanAnni-Yasmin Turhan

Download

Franz Baader, Baris Sertkaya, Anni-Yasmin Turhan
Computing the Least Common Subsumer w.r.t. a Background Terminology
Proceedings of the 2004 International Workshop on Description Logics (DL2004), CEUR-WS, 2004

Details
Bibtex

KurzfassungAbstract
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 lcs w.r.t. a background terminology.
Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory

@inproceedings{ BaaderSertkayaTurhanDL2004,
  author = {Franz {Baader} and Baris {Sertkaya} and Anni-Yasmin {Turhan}},
  booktitle = {Proceedings of the 2004 International Workshop on Description Logics ({DL2004})},
  series = {CEUR-WS},
  title = {Computing the Least Common Subsumer w.r.t. a Background Terminology},
  year = {2004},
}