User Tools

Site Tools

Approximating Most Specific Concepts in Description Logics with Existential Restrictions (BibTeX)

  author      = {Ralf K{\"u}sters and Ralf Molitor},
  title       = {{Approximating Most Specific Concepts in Description Logics with Existential Restrictions}},
  booktitle   = {Proceedings of the Joint German/Austrian Conference on Artificial Intelligence, 24th German / 9th Austrian Conference on Artificial Intelligence (KI 2001)},
  pages       = {33--47},
  publisher   = {Springer-Verlag},
  series      = {Lecture Notes in Artificial Intelligence},
  address     = {Vienna, Austria},
  volume      = 2174,
  year        = 2001,
  editor      = {F.~Baader},
  abstract    = {Computing the most specific concept (msc) is an inference task that allows to abstract from individuals defined in description logic (DL) knowledge bases. For DLs that allow for existential restrictions or number restrictions, however, the msc need not exist unless one allows for cyclic concepts interpreted with the greatest fixed-point semantics. Since such concepts cannot be handled by current DL-systems, we propose to approximate the msc. We show that for the DL ALE, which has concept conjunction, a restricted form of negation, existential restrictions, and value restrictions as constructors, approximations of the msc always exist and can effectively be computed.}