{"type":"ScholarlyArticle","title":"Conservative Rewritability of Description Logic TBoxes","authors":[{"name":"Boris Konev","slug":"boris-konev","given":"Boris","family":"Konev","affiliation":""},{"name":"Carsten Lutz","slug":"carsten-lutz","given":"Carsten","family":"Lutz","affiliation":""},{"name":"Frank Wolter","slug":"frank-wolter","given":"Frank","family":"Wolter","affiliation":""},{"name":"Michael Zakharyaschev","slug":"michael-zakharyaschev","given":"Michael","family":"Zakharyaschev","affiliation":""}],"abstract":"We investigate the problem of conservative rewritability of a TBox T in a description logic L into a TBox T' in a weaker description logic L'. We focus on model-conservative rewritability (T' entails T and all models of T are expandable to models of T'), subsumption-conservative rewritability (T' entails T and all subsumptions in the signature of T entailed by T' are entailed by T), and standard description logics between ALC and ALCQI. We give model-theoretic characterizations of conservative rewritability via bisimulations, inverse p-morphisms and generated subinterpretations, and use them to obtain a few rewriting algorithms and complexity results for deciding rewritability.","doi":null,"url":"https://ijcai.org/proceedings/2016/167","pdf":"https://ijcai.org/proceedings/2016/0167.pdf","markdown":"https://ijcai.org/proceedings/2016/167.md","bibtex":"https://ijcai.org/proceedings/2016/bibtex/167","volume":{"slug":"2016","title":"Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2016","url":"https://ijcai.org/proceedings/2016/","year":2016,"location":"New York, NY, USA","dates":"9–15 July 2016","editors":"Subbarao Kambhampati","isbn":"978-1-57735-770-4; 978-1-57735-771-1","publisher":"AAAI Press / International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":167,"pages":{"first":1153,"last":1158},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}