Least common subsumer computation w.r.t. cyclic ALN-terminologies

Aus International Center for Computational Logic
Wechseln zu:Navigation, Suche

Toggle side column

Least common subsumer computation w.r.t. cyclic ALN-terminologies

Franz BaaderFranz Baader,  R. KüstersR. Küsters
Franz Baader, R. Küsters
Least common subsumer computation w.r.t. cyclic ALN-terminologies
Proceedings of the 1998 International Workshop on Description Logics (DL'98), 1998
  • KurzfassungAbstract
    Computing least common subsumers (lcs) and most specific concepts (msc) are inference tasks that can be used to support the ``bottom up construction of knowledge bases for KR systems based on description logic. For the description logic $mathcal{ALN}$, the msc need not always exist if one restricts the attention to acyclic concept descriptions. In this paper, we extend the notions lcs and msc to cyclic descriptions, and show how they can be computed. Our approach is based on the automata-theoretic characterizations of fixed-point semantics for cyclic terminologies developed in previous papers.
  • Forschungsgruppe:Research Group: Automatentheorie
@inproceedings{ BaaderKuesters-DL-1998,
  address = {Trento, Italy},
  author = {F. {Baader} and R. {K{\"u}sters}},
  booktitle = {Proceedings of the 1998 International Workshop on Description Logics (DL'98)},
  title = {Least common subsumer computation w.r.t. cyclic $\mathcal{ALN}$-terminologies},
  year = {1998},
}