Computing Least Common Subsumers in ALEN

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

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

Download

R. Küsters, R. Molitor
Computing Least Common Subsumers in ALEN
Technical Report, LuFG Theoretical Computer Science, RWTH Aachen, volume 00-07, 2000. LTCS-Report

Details
Bibtex

KurzfassungAbstract
Computing the least common subsumer (lcs) in description logics is an inference task first introduced for sublanguages of CLASSIC. Roughly speaking, the lcs of a set of concept descriptions is the most specific concept description that subsumes all of the input descriptions. As such, the lcs allows to extract the commonalities from given concept descriptions, a task essential for several applications like, e.g., inductive learning, information retrieval, or the bottom-up construction of KR-knowledge bases. Previous work on the lcs has concentrated on description logics that either allow for number restrictions or for existential restrictions. Many applications, however, require to combine these constructors. In this work, we present an lcs algorithm for the description logic ALEN, which allows for both constructors (as well as concept conjunction, primitive negation, and value restrictions). The proof of correctness of our lcs algorithm is based on an appropriate structural characterization of subsumption in ALEN also introduced in this paper.
Bemerkung: Note: See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.
Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory

@techreport{ KuestersMolitor-LTCS-00-07,
  address = {Germany},
  author = {R. {K{\"u}sters} and R. {Molitor}},
  institution = {LuFG Theoretical Computer Science, RWTH Aachen},
  note = {See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.},
  number = {00-07},
  title = {Computing Least Common Subsumers in ALEN},
  type = {LTCS-Report},
  year = {2000},
}