On the Local Closed-World Assumption of Data-Sources

The Closed-World Assumption (CWA) on a database expresses that an atom not in the database is false. The CWA is only applicable in domains where the database has complete knowledge. In many cases, for example in the context of distributed databases, a data source has only complete knowledge about part of the domain of discourse. In this paper, we introduce an expressive and intuitively appealing method of representing a local closed-world assumption (LCWA) of autonomous data-sources. This approach distinguishes between the data that is conveyed by a data-source and the meta-knowledge about the area in which these data is complete. The data is stored in a relational database that can be queried in the standard way, whereas the meta-knowledge about its completeness is expressed by a first order theory that can be processed by an independent reasoning system (for example a mediator). We consider different ways of representing our approach, relate it to other methods of representing local closed-word assumptions of data-sources, and show some useful properties of our framework which facilitate its application in real-life systems.

[1]  John Domingue,et al.  Artificial Intelligence: Methodology, Systems, and Applications, 12th International Conference, AIMSA 2006, Varna, Bulgaria, September 12-15, 2006, Proceedings , 2006, AIMSA.

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

[3]  Vladimir Lifschitz,et al.  Formalizing Common Sense: Papers by John McCarthy , 1998 .

[4]  Todd D. Millstein,et al.  Query containment for data integration systems , 2003, J. Comput. Syst. Sci..

[5]  Oren Etzioni,et al.  Sound and Efficient Closed-World Reasoning for Planning , 1997, Artif. Intell..

[6]  Raymond Reiter,et al.  Towards a Logical Reconstruction of Relational Database Theory , 1982, On Conceptual Modelling.

[7]  Malcolm P. Atkinson,et al.  Issues Raised by Three Years of Developing PJama: An Orthogonally Persistent Platform for Java , 1999, ICDT.

[8]  Gösta Grahne,et al.  Information Integration and Incomplete Information , 2002, IEEE Data Eng. Bull..

[9]  Antonis C. Kakas,et al.  Computational Logic: Logic Programming and Beyond , 2002, Lecture Notes in Computer Science.

[10]  Alberto O. Mendelzon,et al.  Tableau Techniques for Querying Information Sources through Global Schemas , 1999, ICDT.

[11]  Diego Calvanese,et al.  Description Logics for Information Integration , 2002, Computational Logic: Logic Programming and Beyond.

[12]  Felix Naumann,et al.  Completeness of integrated information sources , 2004, Inf. Syst..

[13]  Marie-Christine Rousset.  Knowledge Representation for Information Integration , 2002, ISMIS.

[14]  Patrick Doherty,et al.  Efficient Reasoning Using the Local Closed-World Assumption , 2000, AIMSA.

[15]  Maurice Bruynooghe,et al.  Data Integration Using ID-Logic , 2004, CAiSE.

[16]  Joseph Y. Halpern,et al.  Knowledge and common knowledge in a distributed environment , 1984, JACM.

[17]  Alon Y. Halevy,et al.  Recursive Query Plans for Data Integration , 2000, J. Log. Program..

[18]  John McCarthy,et al.  Applications of Circumscription to Formalizing Common Sense Knowledge , 1987, NMR.