Matching in Description Logics with Existential Restrictions

Franz BaaderFranz Baader, R. KüstersR. Küsters

Datei:BaaderKuesters-LTCS-99-07-1999.ps.gz

Download

Franz Baader, R. Küsters
Matching in Description Logics with Existential Restrictions
Technical Report, LuFg Theoretical Computer Science, RWTH Aachen, volume LTCS-99-07, 1999. LTCS-Report

Details
Bibtex

KurzfassungAbstract
Matching of concepts with variables (concept patterns) is a relatively new operation that has been introduced in the context of description logics, originally to help filter out unimportant aspects of large concepts appearing in industrial-strength knowledge bases. Previous work has concentrated on (sub-)languages of CLASSIC, which in particular do not allow for existential restrictions. In this work, we present sound and complete decision algorithms for the solvability of matching problems and for computing sets of matchers for matching problems in description logics with existential restrictions.
Bemerkung: Note: See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html
Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory

@techreport{ BaaderKuesters-LTCS-99-07-1999,
  address = {Germany},
  author = {F. {Baader} and R. {K{\"u}sters}},
  institution = {LuFg Theoretical Computer Science, RWTH Aachen},
  note = {See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html},
  number = {LTCS-99-07},
  title = {Matching in Description Logics with Existential Restrictions},
  type = {LTCS-Report},
  year = {1999},
}