User Tools

Site Tools

Matching under Side Conditions in Description Logics (BibTeX)

  author      = {F.~Baader and S.~Brandt and R.~K{\"u}sters},
  title       = {{Matching under Side Conditions in Description Logics}},
  booktitle   = {Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence (IJCAI 2001)},
  pages       = {213--218},
  publisher   = {Morgan Kaufman},
  editor      = {B.~Nebel},
  year        = 2001,
  abstract    = {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: matching under subsumption conditions remains polynomial, while strict subsumption conditions increase the complexity to NP.}