← 研踪 PaperTrailarXiv:2611.13138 · v1
Answering Conjunctive Queries over Linear Existential Rules with Transitivity
首次提交 2026-11-10 03:19
版本更新 2026-11-10 03:19
雷达观测 2026-11-11 11:04
摘要
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
观测到的版本
相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。
v1 · 2026-11-10 03:19 · 最新观测版本
Answering Conjunctive Queries over Linear Existential Rules with Transitivity
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
查看此版本解读 →查看此版本原文 ↗