Matching under Side Conditions in Description Logics

Baader, Franz; Brandt, Sebastian; Küsters, Ralf

Matching under Side Conditions in Description Logics

Franz Baader, Sebastian Brandt, Ralf Küsters

Download BibTeX Cite

Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence. Pages 213-217.

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.

Franz Baader, Sebastian Brandt, and Ralf Küsters. 2001. Matching under Side Conditions in Description Logics. In Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, IJCAI-01. IJCAI, 213–217. https://ijcai.org/proceedings/2001/30

@inproceedings{ijcai2001p30,
  title     = {Matching under Side Conditions in Description Logics},
  author    = {Baader, Franz and Brandt, Sebastian and Küsters, Ralf},
  booktitle = {Proceedings of the Seventeenth International Joint Conference on
               Artificial Intelligence, {IJCAI-01}},
  publisher = {International Joint Conferences on Artificial Intelligence},
  pages     = {213--217},
  year      = {2001},
  url       = {https://ijcai.org/proceedings/2001/30},
}

TY  - CPAPER
TI  - Matching under Side Conditions in Description Logics
AU  - Baader, Franz
AU  - Brandt, Sebastian
AU  - Küsters, Ralf
T2  - Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, IJCAI-01
PB  - International Joint Conferences on Artificial Intelligence
PY  - 2001
SP  - 213
EP  - 217
UR  - https://ijcai.org/proceedings/2001/30
ER  -