Query Rewriting for DL-Lite with n-ary Concrete Domains

Query Rewriting for DL-Lite with n-ary Concrete Domains

Franz Baader, Stefan Borgwardt, Marcel Lippmann

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence
Main track. Pages 786-792. https://doi.org/10.24963/ijcai.2017/109

We investigate ontology-based query answering (OBQA) in a setting where both the ontology and the query can refer to concrete values such as numbers and strings. In contrast to previous work on this topic, the built-in predicates used to compare values are not restricted to being unary. We introduce restrictions on these predicates and on the ontology language that allow us to reduce OBQA to query answering in databases using the so-called combined rewriting approach. Though at first sight our restrictions are different from the ones used in previous work, we show that our results strictly subsume some of the existing first-order rewritability results for unary predicates.
Keywords:
Knowledge Representation, Reasoning, and Logic: Computational Complexity of Reasoning
Knowledge Representation, Reasoning, and Logic: Description Logics and Ontologies
Knowledge Representation, Reasoning, and Logic: Logics for Knowledge Representation