On the limits of machine knowledge
Open Access
- 1 July 2021
- journal article
- conference paper
- Published by Association for Computing Machinery (ACM) in Proceedings of the VLDB Endowment
- Vol. 14 (12) , 3175-3177
Abstract
General-purpose knowledge bases (KBs) are an important component of several data-driven applications. Pragmatically constructed from available web sources, these KBs are far from complete, which poses a set of challenges in curation as well as consumption. In this tutorial we discuss how completeness, recall and negation in DBs and KBs can be represented, extracted, and inferred. We proceed in 5 parts: (i) We introduce the logical foundations of knowledge representation and querying under partial closed-world semantics. (ii) We show how information about recall can be identified in KBs and in text, and (iii) how it can be estimated via statistical patterns. (iv) We show how interesting negative statements can be identified, and (v) how recall can be targeted in a comparative notion.Keywords
This publication has 25 references indexed in Scilit:
- Predicting Completeness in Knowledge Bases2017
- WikidataCommunications of the ACM, 2014
- Partial results in database systems2014
- AMIE2013
- Crowdsourced enumeration queries2013
- Completeness Statements about RDF Data Sources and Their Use for Query Answering2013
- Towards a logical reconstruction of a theory for locally closed databasesACM Transactions on Database Systems, 2008
- Yago2007
- Integrity = validity + completenessACM Transactions on Database Systems, 1989
- ON CLOSED WORLD DATA BASES1981