Query Answering with Transitive and Linear-Ordered Data
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence. Pages 893-898.
Abstract
We consider entailment problems involving powerful constraint languages such as guarded existential rules, in which additional semantic restrictions are put on a set of distinguished relations. We consider restricting a relation to be transitive, restricting a relation to be the transitive closure of another relation, and restricting a relation to be a linear order. We give some natural generalizations of guardedness that allow inference to be decidable in each case, and isolate the complexity of the corresponding decision problems. Finally we show that slight changes in our conditions lead to undecidability.
@inproceedings{ijcai2016p131,
title = {Query Answering with Transitive and Linear-Ordered Data},
author = {Amarilli, Antoine and Benedikt, Michael and Bourhis, Pierre and Boom, Michael Vanden},
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 = {893--898},
year = {2016},
month = {7},
url = {https://ijcai.org/proceedings/2016/131},
}
TY - CPAPER TI - Query Answering with Transitive and Linear-Ordered Data AU - Amarilli, Antoine AU - Benedikt, Michael AU - Bourhis, Pierre AU - Boom, Michael Vanden 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 - 893 EP - 898 UR - https://ijcai.org/proceedings/2016/131 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
