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 条
  • [31] On the Data Complexity of Consistent Query Answering
    Balder ten Cate
    Gaëlle Fontaine
    Phokion G. Kolaitis
    Theory of Computing Systems, 2015, 57 : 843 - 891
  • [32] Preference-Based Query Answering in Probabilistic Datalog+/- Ontologies
    Lukasiewicz, Thomas
    Martinez, Maria Vanina
    Simari, Gerardo I.
    Tifrea-Marciuska, Oana
    JOURNAL ON DATA SEMANTICS, 2015, 4 (02) : 81 - 101
  • [33] An Evolutionary Perspective on Approximate RDF Query Answering
    Gueret, Christophe
    Oren, Eyal
    Schlobach, Stefan
    Schut, Martijn
    SCALABLE UNCERTAINTY MANAGEMENT, SUM 2008, 2008, 5291 : 215 - 228
  • [34] Approximate Query Answering by Twig Level Analysis
    Sijin, P.
    Champa, H. N.
    PROCEEDINGS OF THE 2021 FIFTH INTERNATIONAL CONFERENCE ON I-SMAC (IOT IN SOCIAL, MOBILE, ANALYTICS AND CLOUD) (I-SMAC 2021), 2021, : 942 - 950
  • [35] Overcoming limitations of approximate query answering in OLAP
    Cuzzocrea, A
    9TH INTERNATIONAL DATABASE ENGINEERING & APPLICATION SYMPOSIUM, PROCEEDINGS, 2005, : 200 - 209
  • [36] Approximate Query Answering over Open Data
    Zhang, Mengqi
    Mundra, Pranay
    Chikweze, Chukwubuikem
    Nargesian, Fatemeh
    Weikum, Gerhard
    WORKSHOP ON HUMAN-IN-THE-LOOP DATA ANALYTICS, HILDA 2023, 2023,
  • [37] A general Datalog-based framework for tractable query answering over ontologies
    Cali, Andrea
    Gottlob, Georg
    Lukasiewicz, Thomas
    JOURNAL OF WEB SEMANTICS, 2012, 14 : 57 - 83
  • [38] A remark on the complexity of consistent conjunctive query answering under primary key violations
    Wijsen, Jef
    INFORMATION PROCESSING LETTERS, 2010, 110 (21) : 950 - 955
  • [39] Extending Weakly-Sticky Datalog± Query-Answering Tractability and Optimizations
    Milani, Mostafa
    Bertossi, Leopoldo
    WEB REASONING AND RULE SYSTEMS, (RR 2016), 2016, 9898 : 128 - 143
  • [40] A General Datalog-Based Framework for Tractable Query Answering over Ontologies
    Cali, Andrea
    Gottlob, Georg
    Lukasiewicz, Thomas
    PODS'09: PROCEEDINGS OF THE TWENTY-EIGHTH ACM SIGMOD-SIGACT-SIGART SYMPOSIUM ON PRINCIPLES OF DATABASE SYSTEMS, 2009, : 77 - 86
12345