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 条

[1]

[Anonymous], 2013, IJCAI

[2]

[Anonymous], 2012, Frontiers in Artificial Intelligence and Applications

[3]

Arenas M., 1999, Proceedings of the Eighteenth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, P68, DOI 10.1145/303976.303983

[4]

Bienvenu Meghyn, 2017, Reasoning Web. Logical Foundation of Knowledge Graph Construction and Query Answering. 12th International Summer School 2016. Tutorial Lectures: LNCS 9885, P156, DOI 10.1007/978-3-319-49493-7_5

[5]

Bienvenu M, 2012, P 26 AAAI C ART INT

[6]

Bienvenu M, 2016, AAAI CONF ARTIF INTE, P900

[7]

Bienvenu M, 2014, AAAI CONF ARTIF INTE, P996

[8] Ontology-Based Data Access: A Study through Disjunctive Datalog, CSP, and MMSNP [J].

Bienvenu, Meghyn ;

ten Cate, Balder ;

Lutz, Carsten ;

Wolter, Frank .

ACM TRANSACTIONS ON DATABASE SYSTEMS, 2014, 39 (04)

[9] Taming the Infinite Chase: Query Answering under Expressive Relational Constraints [J].

Cali, Andrea ;

Gottlob, Georg ;

Kifer, Michael .

JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2013, 48 :115-174

[10] A general Datalog-based framework for tractable query answering over ontologies [J].

Cali, Andrea ;

Gottlob, Georg ;

Lukasiewicz, Thomas .

JOURNAL OF WEB SEMANTICS, 2012, 14 :57-83

← 1 2 3 →