Matching under Side Conditions in Description Logics

Franz BaaderFranz Baader, S. BrandtS. Brandt, R. KüstersR. Küsters

Datei:BaaderBrandt+-LTCS-01-02.ps.gz

Download

Franz Baader, S. Brandt, R. Küsters
Matching under Side Conditions in Description Logics
Technical Report, LuFG Theoretical Computer Science, RWTH Aachen, volume 01-02, 2001. LTCS-Report

Details
Bibtex

KurzfassungAbstract
Whereas matching in Description Logics is now relatively well-investigated, there are only very few formal results on matching under additional side conditions, though these side conditions were already present in the original paper by Borgida and McGuinness introducing matching in DLs. The present paper closes this gap for the DL $aln$ and its sublanguages.
Bemerkung: Note: See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.
Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory

@techreport{ BaaderBrandt+-LTCS-01-02,
  address = {Germany},
  author = {F. {Baader} and S. {Brandt} 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 = {01-02},
  title = {Matching under Side Conditions in Description Logics},
  type = {LTCS-Report},
  year = {2001},
}