{"type":"ScholarlyArticle","title":"Defeasible Inclusions in Low-Complexity DLs: Preliminary Notes","authors":[{"name":"Piero A. Bonatti","slug":"piero-a-bonatti","given":"Piero A.","family":"Bonatti","affiliation":""},{"name":"Marco Faella","slug":"marco-faella","given":"Marco","family":"Faella","affiliation":""},{"name":"Luigi Sauro","slug":"luigi-sauro","given":"Luigi","family":"Sauro","affiliation":""}],"abstract":"We analyze the complexity of reasoning with circumscribed low-complexity DLs such as DL-lite and the EL family, under suitable restrictions on the use of abnormality predicates. We prove that in circumscribed DL-lite<sub>R</sub> complexity drops from NExp<sup>NP</sup> to the second level of the polynomial hierarchy. In EL, reasoning remains ExpTime-hard, in general. However, by restricting the possible occurrences of existential restrictions, we obtain membership in Sigma<sup>p<sub>2</sub></sup> and Pi<sup>p<sub>2</sub></sup> for an extension of EL.Piero A. Bonatti, Marco Faella, Luigi Sauro","doi":null,"url":"https://ijcai.org/proceedings/2009/121","pdf":"https://ijcai.org/proceedings/2009/0121.pdf","markdown":"https://ijcai.org/proceedings/2009/121.md","bibtex":"https://ijcai.org/proceedings/2009/bibtex/121","volume":{"slug":"2009","title":"Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2009","url":"https://ijcai.org/proceedings/2009/","year":2009,"location":"Pasadena, California, USA","dates":"","editors":"Hiroaki Kitano","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":121,"pages":{"first":696,"last":700},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}