In this paper we study instance-level update in DL-LiteA, the description logic underlying the OWL 2 QL standard. In particular we focus on formula-based approaches to ABox insertion and deletion. We show that DL-LiteA, which is well-known for enjoying first-order rewritability of query answering, enjoys a first-order rewritability property also for updates. That is, every update can be reformulated into a set of insertion and deletion instructions computable through a non-recursive datalog program. Such a program is readily translatable into a first-order query over the ABox considered as a database, and hence into SQL. By exploiting this result, we implement an update component for DL-LiteA-based systems and perform some experiments showing that the approach works in practice.
%0 Conference Paper
%1 DORS-P-16
%A Giacomo, Giuseppe De
%A Oriol, Xavier
%A Rosati, Riccardo
%A Savo, Domenico Fabio
%B The Semantic Web - ISWC 2016 - 15th International Semantic Web Conference, Kobe, Japan, October 17-21, 2016, Proceedings, Part I
%D 2016
%K optique-project
%P 167--183
%R 10.1007/978-3-319-46523-4_11
%T Updating DL-Lite Ontologies Through First-Order Queries
%X In this paper we study instance-level update in DL-LiteA, the description logic underlying the OWL 2 QL standard. In particular we focus on formula-based approaches to ABox insertion and deletion. We show that DL-LiteA, which is well-known for enjoying first-order rewritability of query answering, enjoys a first-order rewritability property also for updates. That is, every update can be reformulated into a set of insertion and deletion instructions computable through a non-recursive datalog program. Such a program is readily translatable into a first-order query over the ABox considered as a database, and hence into SQL. By exploiting this result, we implement an update component for DL-LiteA-based systems and perform some experiments showing that the approach works in practice.
@inproceedings{DORS-P-16,
abstract = {In this paper we study instance-level update in DL-LiteA, the description logic underlying the OWL 2 QL standard. In particular we focus on formula-based approaches to ABox insertion and deletion. We show that DL-LiteA, which is well-known for enjoying first-order rewritability of query answering, enjoys a first-order rewritability property also for updates. That is, every update can be reformulated into a set of insertion and deletion instructions computable through a non-recursive datalog program. Such a program is readily translatable into a first-order query over the ABox considered as a database, and hence into SQL. By exploiting this result, we implement an update component for DL-LiteA-based systems and perform some experiments showing that the approach works in practice.},
added-at = {2016-10-24T11:58:14.000+0200},
audience = {academic},
author = {Giacomo, Giuseppe De and Oriol, Xavier and Rosati, Riccardo and Savo, Domenico Fabio},
biburl = {https://www.bibsonomy.org/bibtex/2965a5575c3e4552ae227a4b2f310c9b2/savo.fabio},
booktitle = {The Semantic Web - {ISWC} 2016 - 15th International Semantic Web Conference, Kobe, Japan, October 17-21, 2016, Proceedings, Part {I}},
doi = {10.1007/978-3-319-46523-4_11},
interhash = {38aee409d347d54d5f8986f7430a6a11},
intrahash = {965a5575c3e4552ae227a4b2f310c9b2},
keywords = {optique-project},
openaccess = {No},
pages = {167--183},
partneroptique = {UNIROMA1},
timestamp = {2016-12-01T17:42:52.000+0100},
title = {Updating DL-Lite Ontologies Through First-Order Queries},
wpoptique = {WP4},
year = 2016,
yearoptique = {Y4}
}