---
title: "Matching under Side Conditions in Description Logics"
authors:
  - "Franz Baader"
  - "Sebastian Brandt"
  - "Ralf Küsters"
doi: ""
url: "https://ijcai.org/proceedings/2001/30"
pdf: "https://ijcai.org/proceedings/2001/0030.pdf"
venue: "Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence"
year: 2001
pages: "213-217"
track: ""
keywords:
---

# Matching under Side Conditions in Description Logics

Franz Baader, Sebastian Brandt, Ralf Küsters

*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.