跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv: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
arXiv ↗PDF ↗

摘要

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

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 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

查看此版本解读 →查看此版本原文 ↗