Polynomial Datalog Rewritings for Expressive Description Logics with Closed Predicates
Abstract
We consider instance queries mediated by an ontology expressed in the expressive DL ALCHIO with closed predicates. We observe that such queries are nonmonotonic and cannot be expressed in monotonic variants of Datalog, but a polynomial time translation into disjunctive Datalog extended with negation as failure is feasible. If no closed predicates are present — in the case of classical instance checking in ALCHIO — our translation yields a positive disjunctive Datalog program of polynomial size. To the best of our knowledge, this is the first polynomial time translation of an expressive (non-Horn) DL into disjunctive Datalog. PDF
Cite
Text
Ahmetaj et al. "Polynomial Datalog Rewritings for Expressive Description Logics with Closed Predicates." International Joint Conference on Artificial Intelligence, 2016.Markdown
[Ahmetaj et al. "Polynomial Datalog Rewritings for Expressive Description Logics with Closed Predicates." International Joint Conference on Artificial Intelligence, 2016.](https://mlanthology.org/ijcai/2016/ahmetaj2016ijcai-polynomial/)BibTeX
@inproceedings{ahmetaj2016ijcai-polynomial,
title = {{Polynomial Datalog Rewritings for Expressive Description Logics with Closed Predicates}},
author = {Ahmetaj, Shqiponja and Ortiz, Magdalena and Simkus, Mantas},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2016},
pages = {878-885},
url = {https://mlanthology.org/ijcai/2016/ahmetaj2016ijcai-polynomial/}
}