Query Answering with Transitive and Linear-Ordered Data
Databases
2019-03-21 v1 Logic in Computer Science
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.
Cite
@article{arxiv.1607.00813,
title = {Query Answering with Transitive and Linear-Ordered Data},
author = {Antoine Amarilli and Michael Benedikt and Pierre Bourhis and Michael Vanden Boom},
journal= {arXiv preprint arXiv:1607.00813},
year = {2019}
}
Comments
36 pages. To appear in IJCAI 2016. Extended version with proofs