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

Franz BaaderFranz Baader, Stefan BorgwardtStefan Borgwardt, Marcel LippmannMarcel Lippmann

Download

Franz Baader, Stefan Borgwardt, Marcel Lippmann
Query Rewriting for DL-Lite with n-ary Concrete Domains
In Carles Sierra, eds., Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI'17), to appear

Details
Bibtex

KurzfassungAbstract
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.
Projekt:Project: GoAsQ, HAEC, HAEC B02
Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory

@inproceedings{BBL2017,
  author    = {Franz Baader and Stefan Borgwardt and Marcel Lippmann},
  title     = {Query Rewriting for {DL-Lite} with n-ary Concrete Domains},
  editor    = {Carles Sierra},
  booktitle = {Proceedings of the 26th International Joint Conference on
               Artificial Intelligence (IJCAI'17)},
  year      = {2017}
}