Complexity of Approximate Query Answering under Inconsistency in Datalog

被引：0

作者：

Lukasiewicz, Thomas ^{[1
]}

Malizia, Enrico ^{[2
]}

Molinaro, Cristian ^{[3
]}

机构：

[1] Univ Oxford, Dept Comp Sci, Oxford, England

[2] Univ Exeter, Dept Comp Sci, Exeter, Devon, England

[3] Univ Calabria, DIMES, Calabria, Italy

来源：

PROCEEDINGS OF THE TWENTY-SEVENTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE | 2018年

基金：

英国工程与自然科学研究理事会;

关键词：

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

Several semantics have been proposed to query inconsistent ontological knowledge bases, including the intersection of repairs and the intersection of closed repairs as two approximate inconsistency-tolerant semantics. In this paper, we analyze the complexity of conjunctive query answering under these two semantics for a wide range of Datalog(+/-) languages. We consider both the standard setting, where errors may only be in the database, and the generalized setting, where also the rules of a Datalog(+/-) knowledge base may be erroneous.

引用

页码：1921 / 1927

页数：7

共 26 条

[21] A novel characterization of the complexity class ΘkP based on counting and comparison [J].