arXiv · 2611.13138
Answering Conjunctive Queries over Linear Existential Rules with Transitivity
Abstract
We study Conjunctive Query Entailment Problem over ontologies con- sisting of Linear Tuple Generating Dependencies and transitivity asser- tions. A special case of this problem has been shown to be decidable in [1]. In particular, it covers the case of linear single head TGDs with bi- nary signature. In This paper we show that The problem for linear multi head TGDs with binary signature is Ackermanian hard
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Cristina Feier, Tomasz Gogacz, Filip Murlak. 2026-11-09. Answering Conjunctive Queries over Linear Existential Rules with Transitivity. https://searcharxiv.com/abs/2611.13138
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.