Polynomial Datalog Rewritings for Expressive Description Logics with Closed Predicates
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence. Pages 878-884.
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.
@inproceedings{ijcai2016p129,
title = {Polynomial Datalog Rewritings for Expressive Description Logics with Closed Predicates},
author = {Ahmetaj, Shqiponja and Ortiz, Magdalena and Simkus, Mantas},
booktitle = {Proceedings of the Twenty-Fifth International Joint Conference on
Artificial Intelligence, {IJCAI-16}},
publisher = {AAAI Press / International Joint Conferences on Artificial Intelligence},
editor = {Subbarao Kambhampati},
pages = {878--884},
year = {2016},
month = {7},
url = {https://ijcai.org/proceedings/2016/129},
}
TY - CPAPER TI - Polynomial Datalog Rewritings for Expressive Description Logics with Closed Predicates AU - Ahmetaj, Shqiponja AU - Ortiz, Magdalena AU - Simkus, Mantas T2 - Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI-16 PB - AAAI Press / International Joint Conferences on Artificial Intelligence PY - 2016 SP - 878 EP - 884 UR - https://ijcai.org/proceedings/2016/129 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
