Certain answers as objects and knowledge

被引:24
|
作者
Libkin, Leonid [1 ]
机构
[1] Univ Edinburgh, Sch Informat, Edinburgh EH8 9YL, Midlothian, Scotland
基金
英国工程与自然科学研究理事会;
关键词
Incomplete information; Database queries; Certain answers; Data models; Certain knowledge; Open and closed world; Efficient computation; INCOMPLETE INFORMATION; XML;
D O I
10.1016/j.artint.2015.11.004
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The standard way of answering queries over incomplete databases is to compute certain answers, defined as the intersection of query answers on all complete databases that the incomplete database represents. But is this universally accepted definition correct? We argue that this "one-size-fits-all" definition can often lead to counterintuitive or just plain wrong results, and propose an alternative framework for defining certain answers. The idea of the framework is to move away from the standard, in the database literature, assumption that query results be given in the form of a database object, and to allow instead two alternative representations of answers: as objects defining all other answers, or as knowledge we can deduce with certainty about all such answers. We show that the latter is often easier to achieve than the former, that in general certain answers need not be defined as intersection, and may well contain missing values in them. We also show that with a proper choice of semantics, we can often reduce computing certain answers - as either objects or knowledge - to standard query evaluation. We describe the framework in the most general way, applicable to a variety of data models, and test it on three concrete relational semantics of incompleteness: open, closed, and weak closed world. (C) 2015 Elsevier B.V. All rights reserved.
引用
收藏
页码:1 / 19
页数:19
相关论文
共 50 条
  • [1] Certain Answers as Objects and Knowledge
    Libkin, Leonid
    FOURTEENTH INTERNATIONAL CONFERENCE ON THE PRINCIPLES OF KNOWLEDGE REPRESENTATION AND REASONING, 2014, : 328 - 337
  • [2] Negative Knowledge for Certain Query Answers
    Libkin, Leonid
    WEB REASONING AND RULE SYSTEMS, (RR 2016), 2016, 9898 : 111 - 127
  • [3] Certain Answers to a SPARQL Query over a Knowledge Base
    Corman, Julien
    Xiao, Guohui
    SEMANTIC TECHNOLOGY, JIST 2019: PROCEEDINGS, 2020, 12032 : 320 - 335
  • [4] Knowledge-Preserving Certain Answers for SQL-like Queries
    Toussaint, Etienne
    Guagliardo, Paolo
    Libkin, Leonid
    KR2020: PROCEEDINGS OF THE 17TH INTERNATIONAL CONFERENCE ON PRINCIPLES OF KNOWLEDGE REPRESENTATION AND REASONING, 2020, : 758 - 767
  • [5] Explainable Certain Answers
    Amendola, Giovanni
    Libkin, Leonid
    PROCEEDINGS OF THE TWENTY-SEVENTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2018, : 1683 - 1690
  • [6] How to Define Certain Answers
    Libkin, Leonid
    PROCEEDINGS OF THE TWENTY-FOURTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI), 2015, : 4282 - 4288
  • [7] Certain Answers for XML Queries
    David, Claire
    Libkin, Leonid
    Murlak, Filip
    PODS 2010: PROCEEDINGS OF THE TWENTY-NINTH ACM SIGMOD-SIGACT-SIGART SYMPOSIUM ON PRINCIPLES OF DATABASE SYSTEMS, 2010, : 191 - 202
  • [8] Approximate answers in databases of labeled objects
    Pankowski, T
    INTELLIGENT INFORMATION SYSTEMS, 2000, : 351 - 361
  • [9] A SEMANTICS FOR COMPLEX OBJECTS AND APPROXIMATE ANSWERS
    BUNEMAN, OP
    DAVIDSON, SB
    WATTERS, A
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1991, 43 (01) : 170 - 218
  • [10] Certain Answers for SPARQL with Blank Nodes
    Hernandez, Daniel
    Gutierrez, Claudio
    Hogan, Aidan
    SEMANTIC WEB - ISWC 2018, PT I, 2018, 11136 : 337 - 353