Efficient reasoning in proper knowledge bases with unknown individuals

Authors:
Giuseppe De Giacomo;Yves Lespérance;Hector J. Levesque
Affiliations:
Sapienza Università di Roma, Rome, Italy;York University, Toronto, Canada;University of Toronto, Toronto, Canada
Venue:
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Year:
2011

Citing 18
Cited 1

Incomplete Information in Relational Databases

Journal of the ACM (JACM)
A sound and sometimes complete query evaluation algorithm for relational databases with null values

Journal of the ACM (JACM)
Querying logical databases

Journal of Computer and System Sciences
On the complexity of bounded-variable queries (extended abstract)

PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Logical approaches to incomplete information: a survey

Logics for databases and information systems
Data integration: a theoretical perspective

Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Information Integration Using Logical Views

ICDT '97 Proceedings of the 6th International Conference on Database Theory
Optimal implementation of conjunctive queries in relational data bases

STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
On the containment of conjunctive queries

Computer Science in Perspective
Schema mappings, data exchange, and metadata management

Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Representing and querying XML with incomplete information

ACM Transactions on Database Systems (TODS)
Tractable reasoning in incomplete first-order knowledge bases

Tractable reasoning in incomplete first-order knowledge bases
On the expressiveness of Levesque's normal form

Journal of Artificial Intelligence Research
A tractability result for reasoning with incomplete first-order knowledge bases

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
$${10^{(10^{6})}}$$ worlds and beyond: efficient representation and processing of incomplete information

The VLDB Journal — The International Journal on Very Large Data Bases
Linking data to ontologies

Journal on data semantics X
XML with incomplete information

Journal of the ACM (JACM)
Foundations of uncertain-data integration

Proceedings of the VLDB Endowment

Decidable reasoning in a logic of limited belief with introspection and unknown individuals

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

This work develops an approach to efficient reasoning in first-order knowledge bases with incomplete information. We build on Levesque's proper knowledge bases approach, which supports limited incomplete knowledge in the form of a possibly infinite set of positive or negative ground facts. We propose a generalization which allows these facts to involve unknown individuals, as in the work on labeled null values in databases. Dealing with such unknown individuals has been shown to be a key feature in the database literature on data integration and data exchange. In this way, we obtain one of the most expressive first-order open-world settings for which reasoning can still be done efficiently by evaluation, as in relational databases. We show the soundness of the reasoning procedure and its completeness for queries in a certain normal form.