Efficient Reasoning in Proper Knowledge Bases with Unknown Individuals

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.

[1]  W. C. Hilles,et al.  Data exchange. , 1976, Journal of medical education.

[2]  Ashok K. Chandra,et al.  Optimal implementation of conjunctive queries in relational data bases , 1977, STOC '77.

[3]  Tomasz Imielinski,et al.  Incomplete Information in Relational Databases , 1984, JACM.

[4]  Raymond Reiter,et al.  A sound and sometimes complete query evaluation algorithm for relational databases with null values , 1986, JACM.

[5]  Moshe Y. Vardi.  Querying Logical Databases , 1986, J. Comput. Syst. Sci..

[6]  Moshe Y. Vardi.  On the complexity of bounded-variable queries (extended abstract) , 1995, PODS '95.

[7]  Moshe Y. Vardi.  On the Complexity of Bounded-Variable Queries. , 1995, PODS 1995.

[8]  Ron van der Meyden,et al.  Logical Approaches to Incomplete Information: A Survey , 1998, Logics for Databases and Information Systems.

[9]  Hector J. Levesque.  A Completeness Result for Reasoning with Incomplete First-Order Knowledge Bases , 1998, KR.

[10]  Jeffrey D. Ullman,et al.  Information integration using logical views , 1997, Theor. Comput. Sci..

[11]  Maurizio Lenzerini,et al.  Data integration: a theoretical perspective , 2002, PODS.

[12]  Rolf Klein,et al.  Computer Science in Perspective , 2003, Lecture Notes in Computer Science.

[13]  A Tractability Result for Reasoning with Incomplete First-Order Knowledge Bases , 2003, IJCAI.

[14]  Fang Wei-Kleiner,et al.  On the Containment of Conjunctive Queries , 2003, Computer Science in Perspective.

[15]  Phokion G. Kolaitis.  Schema mappings, data exchange, and metadata management , 2005, PODS '05.

[16]  Serge Abiteboul,et al.  Representing and querying XML with incomplete information , 2006, TODS.

[17]  Yongmei Liu.  Tractable reasoning in incomplete first-order knowledge bases , 2006 .

[18]  Dan Olteanu,et al.  $${10^{(10^{6})}}$$ worlds and beyond: efficient representation and processing of incomplete information , 2006, 2007 IEEE 23rd International Conference on Data Engineering.

[19]  Dan Olteanu,et al.  10106 Worlds and Beyond: Efficient Representation and Processing of Incomplete Information , 2007, ICDE.

[20]  Diego Calvanese,et al.  Linking Data to Ontologies , 2008, J. Data Semant..

[21]  Gerhard Lakemeyer,et al.  On the Expressiveness of Levesque's Normal Form , 2008, J. Artif. Intell. Res..

[22]  Parag Agrawal,et al.  Foundations of uncertain-data integration , 2010, Proc. VLDB Endow..

[23]  Cristina Sirangelo,et al.  XML with incomplete information , 2010, JACM.

[24]  資訊工程學系.  3/3_陳英瑞教授_department of computer science , 2011 .