TY - GEN
T1 - Practical query rewriting for dl-lite with numerical predicates∗
AU - Alrabbaa, Christian
AU - Koopmann, Patrick
AU - Turhan, Anni-Yasmin
PY - 2019
Y1 - 2019
N2 - We present a method for answering ontology-mediated queries for DL-Lite extended with a concrete domain, where we allow concrete domain predicates to be used in the query as well. Our method is based on query rewriting, a well-known technique for ontology-based query answering (OBQA), where the knowledge provided by the ontology is compiled into the query so that the rewritten query can be evaluated directly over a database. This technique reduces the problem of query answering w.r.t. an ontology to query evaluation over a database instance. Specifically, we consider members of the DL-Lite family extended with unary and binary concrete domain predicates over the real numbers. While approaches for query rewriting DL-Lite with these concrete domain have been investigated theoretically, these approaches use a combined approach in which also the data is processed, and require the concrete domain values occurring in the data to be known in advance, which makes the procedure data-dependent. In contrast, we show how rewritings can be computed in a data-independent fashion.
AB - We present a method for answering ontology-mediated queries for DL-Lite extended with a concrete domain, where we allow concrete domain predicates to be used in the query as well. Our method is based on query rewriting, a well-known technique for ontology-based query answering (OBQA), where the knowledge provided by the ontology is compiled into the query so that the rewritten query can be evaluated directly over a database. This technique reduces the problem of query answering w.r.t. an ontology to query evaluation over a database instance. Specifically, we consider members of the DL-Lite family extended with unary and binary concrete domain predicates over the real numbers. While approaches for query rewriting DL-Lite with these concrete domain have been investigated theoretically, these approaches use a combined approach in which also the data is processed, and require the concrete domain values occurring in the data to be known in advance, which makes the procedure data-dependent. In contrast, we show how rewritings can be computed in a data-independent fashion.
UR - http://www.scopus.com/inward/record.url?scp=85080134249&partnerID=8YFLogxK
U2 - 10.29007/gqll
DO - 10.29007/gqll
M3 - Conference contribution
VL - 65
T3 - EPiC Series in Computing
SP - 15
EP - 27
BT - Proceedings of the 5th Global Conference on Artificial Intelligence, GCAI 2019
A2 - Calvanese, D.
A2 - Iocchi, L.
PB - EasyChair
T2 - 5th Global Conference on Artificial Intelligence, GCAI 2019
Y2 - 17 September 2019 through 19 September 2019
ER -