Consistent Query Answering for Existential Rules under Tuple-Deletion Semantics
CoRR(2024)
摘要
We study consistent query answering over knowledge bases expressed by
existential rules. Specifically, we establish the data complexity of consistent
query answering and repair checking under tuple-deletion semantics for a
general class of disjunctive existential rules and for several subclasses
thereof (acyclic, linear, full, guarded, and sticky). In particular, we
identify several cases in which the above problems are tractable or even
first-order rewritable, and present new query rewriting techniques that can be
the basis for practical inconsistency-tolerant query answering systems.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要