Computing Most Specific Concepts in Description Logics with Existential Restrictions

R. KüstersR. Küsters, R. MolitorR. Molitor

Datei:KuestersMolitor-LTCS-00-05.ps.gz

Download

R. Küsters, R. Molitor
Computing Most Specific Concepts in Description Logics with Existential Restrictions
Technical Report, LuFG Theoretical Computer Science, volume 00-05, 2000. LTCS-Report

Details
Bibtex

KurzfassungAbstract
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 number restrictions or existential 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.
Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory

@techreport{ KuestersMolitor-LTCS-00-05,
  address = {RWTH Aachen, Germany},
  author = {R. {K{\"u}sters} and R. {Molitor}},
  institution = {LuFG Theoretical Computer Science},
  number = {00-05},
  title = {Computing Most Specific Concepts in Description Logics with Existential Restrictions},
  type = {LTCS-Report},
  year = {2000},
}