{"type":"ScholarlyArticle","title":"Matching under Side Conditions in Description Logics","authors":[{"name":"Franz Baader","slug":"franz-baader","given":"Franz","family":"Baader","affiliation":""},{"name":"Sebastian Brandt","slug":"sebastian-brandt","given":"Sebastian","family":"Brandt","affiliation":""},{"name":"Ralf Küsters","slug":"ralf-kusters","given":"Ralf","family":"Küsters","affiliation":""}],"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.","doi":null,"url":"https://ijcai.org/proceedings/2001/30","pdf":"https://ijcai.org/proceedings/2001/0030.pdf","markdown":"https://ijcai.org/proceedings/2001/30.md","bibtex":"https://ijcai.org/proceedings/2001/bibtex/30","volume":{"slug":"2001","title":"Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2001","url":"https://ijcai.org/proceedings/2001/","year":2001,"location":"Seattle, Washington, USA","dates":"","editors":"","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":30,"pages":{"first":213,"last":217},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}