%0 Conference Paper %1 conf/ijcai/ArenasBCR13 %A Arenas, Marcelo %A Botoeva, Elena %A Calvanese, Diego %A Ryzhikov, Vladislav %B Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI) %D 2013 %E Rossi, Francesca %I IJCAI/AAAI %K description-logics knowledge-base-exchange myown optique-project %T Exchanging OWL~2~QL Knowledge Bases %U http://www.aaai.org/ocs/index.php/IJCAI/IJCAI13/paper/view/6939 %X The problem of exchanging knowledge between a source and a target knowledge base connected through a mapping has attracted attention recently both in databases and in knowledge representation. In this paper, we study this fundamental problem for knowledge bases and mappings expressed in the description logic DL-Lite_R, which is the formal counterpart of OWL 2 QL. More specifically, we consider the problem of computing universal solutions, which have been identified as one of the most desirable translations to be materialized, and the problem of representing a source TBox by means of a target TBox that captures at best the intensional source information according to a mapping. For the former we provide a novel automata-theoretic technique, and complexity results that range from NP to ExpTime, while for the latter we show NLogSpace-completeness for different variants. %@ 978-1-57735-633-2

@inproceedings{conf/ijcai/ArenasBCR13, abstract = {The problem of exchanging knowledge between a source and a target knowledge base connected through a mapping has attracted attention recently both in databases and in knowledge representation. In this paper, we study this fundamental problem for knowledge bases and mappings expressed in the description logic DL-Lite_R, which is the formal counterpart of OWL 2 QL. More specifically, we consider the problem of computing universal solutions, which have been identified as one of the most desirable translations to be materialized, and the problem of representing a source TBox by means of a target TBox that captures at best the intensional source information according to a mapping. For the former we provide a novel automata-theoretic technique, and complexity results that range from NP to ExpTime, while for the latter we show NLogSpace-completeness for different variants. }, added-at = {2013-10-09T20:39:57.000+0200}, audience = {academic}, author = {Arenas, Marcelo and Botoeva, Elena and Calvanese, Diego and Ryzhikov, Vladislav}, biburl = {https://www.bibsonomy.org/bibtex/2033d092cc2ec6b3f577e9ba38617b1fa/calvanese}, booktitle = {Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI)}, editor = {Rossi, Francesca}, interhash = {0b3f02dc63a4aa9acb0a81373a8c1430}, intrahash = {033d092cc2ec6b3f577e9ba38617b1fa}, isbn = {978-1-57735-633-2}, keywords = {description-logics knowledge-base-exchange myown optique-project}, partneroptique = {FUB}, publisher = {IJCAI/AAAI}, timestamp = {2015-09-18T20:12:45.000+0200}, title = {Exchanging {OWL~2~QL} Knowledge Bases}, url = {http://www.aaai.org/ocs/index.php/IJCAI/IJCAI13/paper/view/6939}, wpoptique = {WP6}, year = 2013, yearoptique = {Y1} }