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
相关论文
共 50 条
  • [21] Approximate query answering in numerical databases
    Hachem, N
    Bao, CY
    Taylor, S
    EIGHTH INTERNATIONAL CONFERENCE ON SCIENTIFIC AND STATISTICAL DATABASE SYSTEMS, PROCEEDINGS, 1996, : 63 - 73
  • [22] Join synopses for approximate query answering
    Acharya, S
    Gibbons, PB
    Poosala, V
    Ramaswamy, S
    SIGMOD RECORD, VOL 28, NO 2 - JUNE 1999: SIGMOD99: PROCEEDINGS OF THE 1999 ACM SIGMOD - INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA, 1999, : 275 - 286
  • [23] Benchmark for Approximate Query Answering Systems
    Di Tria, Francesco
    Lefons, Ezio
    Tangorra, Filippo
    JOURNAL OF DATABASE MANAGEMENT, 2015, 26 (01) : 1 - 29
  • [24] TuG Synopses for Approximate Query Answering
    Spiegel, Joshua
    Polyzotis, Neoklis
    ACM TRANSACTIONS ON DATABASE SYSTEMS, 2009, 34 (01):
  • [25] Inconsistency-tolerant query answering for existential rules
    Lukasiewicz, Thomas
    Malizia, Enrico
    Vanina Martinez, Maria
    Molinaro, Cristian
    Pieris, Andreas
    Simari, Gerardo, I
    ARTIFICIAL INTELLIGENCE, 2022, 307
  • [26] Preference-based inconsistency-tolerant query answering under existential rules
    Calautti, Marco
    Greco, Sergio
    Molinaro, Cristian
    Trubitsyna, Irina
    ARTIFICIAL INTELLIGENCE, 2022, 312
  • [27] A graph-based approach for query answering under inconsistency-tolerant semantics
    Fu X.
    Qi G.
    Zhang Y.
    Jisuanji Yanjiu yu Fazhan/Computer Research and Development, 2016, 53 (02): : 303 - 315
  • [28] Preference-based Inconsistency-Tolerant Query Answering under Existential Rules
    Calautti, Marco
    Greco, Sergio
    Molinaro, Cristian
    Trubitsyna, Irina
    KR2020: PROCEEDINGS OF THE 17TH INTERNATIONAL CONFERENCE ON PRINCIPLES OF KNOWLEDGE REPRESENTATION AND REASONING, 2020, : 203 - 212
  • [29] On the Data Complexity of Consistent Query Answering
    ten Cate, Balder
    Fontaine, Gaelle
    Kolaitis, Phokion G.
    THEORY OF COMPUTING SYSTEMS, 2015, 57 (04) : 843 - 891
  • [30] Preference-Based Query Answering in Probabilistic Datalog plus /- Ontologies
    Lukasiewicz, Thomas
    Martinez, Maria Vanina
    Simari, Gerardo I.
    ON THE MOVE TO MEANINGFUL INTERNET SYSTEMS: OTM 2013 CONFERENCES, 2013, 8185 : 501 - 518
12345