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
基金
英国工程与自然科学研究理事会;
关键词
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 条
  • [1] Complexity of Inconsistency-Tolerant Query Answering in Datalog plus /-
    Lukasiewicz, Thomas
    Martinez, Maria Vanina
    Simari, Gerardo I.
    ON THE MOVE TO MEANINGFUL INTERNET SYSTEMS: OTM 2013 CONFERENCES, 2013, 8185 : 488 - 500
  • [2] Complexity of Inconsistency-Tolerant Query Answering in Datalog plus /- under Cardinality-Based Repairs
    Lukasiewicz, Thomas
    Malizia, Enrico
    Vaicenavicius, Andrius
    THIRTY-THIRD AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTY-FIRST INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE / NINTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2019, : 2962 - 2969
  • [3] A Hybrid Approach to Query Answering Under Expressive Datalog±
    Milani, Mostafa
    Cali, Andrea
    Bertossi, Leopoldo
    WEB REASONING AND RULE SYSTEMS, (RR 2016), 2016, 9898 : 144 - 158
  • [4] Query answering under probabilistic uncertainty in Datalog plus / - ontologies
    Gottlob, Georg
    Lukasiewicz, Thomas
    Martinez, Maria Vanina
    Simari, Gerardo I.
    ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 2013, 69 (01) : 37 - 72
  • [5] Query Answering under Non-guarded Rules in Datalog ±
    Cali, Andrea
    Gottlob, Georg
    Pieris, Andreas
    WEB REASONING AND RULE SYSTEMS, 2010, 6333 : 1 - +
  • [6] Query answering under probabilistic uncertainty in Datalog+ / − ontologies
    Georg Gottlob
    Thomas Lukasiewicz
    Maria Vanina Martinez
    Gerardo I. Simari
    Annals of Mathematics and Artificial Intelligence, 2013, 69 : 37 - 72
  • [7] On Conceptual Graphs and Explanation of Query Answering under Inconsistency
    Arioua, Abdallah
    Tamani, Nouredine
    Croitoru, Madalina
    GRAPH-BASED REPRESENTATION AND REASONING, 2014, 8577 : 51 - 64
  • [8] Query Answering in Probabilistic Datalog plus /- Ontologies under Group Preferences
    Lukasiewicz, Thomas
    Martinez, Maria Vanina
    Simari, Gerardo I.
    Tifrea-Marciuska, Oana
    2013 IEEE/WIC/ACM INTERNATIONAL JOINT CONFERENCES ON WEB INTELLIGENCE (WI) AND INTELLIGENT AGENT TECHNOLOGIES (IAT), VOL 1, 2013, : 171 - 178
  • [9] Consistent Query Answering for Primary Keys in Datalog
    Koutris, Paraschos
    Wijsen, Jef
    THEORY OF COMPUTING SYSTEMS, 2021, 65 (01) : 122 - 178
  • [10] Consistent Query Answering for Primary Keys in Datalog
    Paraschos Koutris
    Jef Wijsen
    Theory of Computing Systems, 2021, 65 : 122 - 178