Query Rewriting for DL-Lite with n-ary Concrete Domains
From International Center for Computational Logic
Query Rewriting for DL-Lite with n-ary Concrete Domains
Talk by Stefan Borgwardt
- Location: APB 3027
- Start: 22. June 2017 at 1:00 pm
- End: 22. June 2017 at 2:00 pm
- Research group: Automata Theory
- Event series: KBS Seminar
- iCal
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.
