{"type":"ScholarlyArticle","title":"Reasoning about Typicality in Low Complexity DLs: The Logics EL⊥Tmin and DL-Litec Tmin","authors":[{"name":"Laura Giordano","slug":"laura-giordano","given":"Laura","family":"Giordano","affiliation":""},{"name":"Valentina Gliozzi","slug":"valentina-gliozzi","given":"Valentina","family":"Gliozzi","affiliation":""},{"name":"Nicola Olivetti","slug":"nicola-olivetti","given":"Nicola","family":"Olivetti","affiliation":""},{"name":"Gian Luca Pozzato","slug":"gian-luca-pozzato","given":"Gian Luca","family":"Pozzato","affiliation":""}],"abstract":"We propose a nonmonotonic extension of low complexity Description Logics EL⊥ and DL-Litecore for reasoning about typicality and defeasible properties. The resulting logics are called EL⊥Tmin and DL-LitecTmin. Concerning DL-LitecTmin, we prove that entailment is in Πp2. With regard to EL⊥Tmin, we first show that entailment remains EXPTIME-hard. Next we consider the known fragment of Left Local EL⊥Tmin and we prove that the complexity of entailment drops to Πp2","doi":"10.5591/978-1-57735-516-8/IJCAI11-155","url":"https://ijcai.org/proceedings/2011/155","pdf":"https://ijcai.org/proceedings/2011/0155.pdf","markdown":"https://ijcai.org/proceedings/2011/155.md","bibtex":"https://ijcai.org/proceedings/2011/bibtex/155","volume":{"slug":"2011","title":"Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2011","url":"https://ijcai.org/proceedings/2011/","year":2011,"location":"Barcelona, Catalonia, Spain","dates":"16–22 July 2011","editors":"Toby Walsh","isbn":"978-1-57735-512-0; 978-1-57735-513-7; 978-1-57735-514-4; 978-1-57735-515-1; 978-1-57735-516-8","publisher":"AAAI Press/International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":155,"pages":{"first":894,"last":898},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}