On the Local Closed-World Assumption of Data-Sources | SpringerLink
Skip to main content

On the Local Closed-World Assumption of Data-Sources

  • Conference paper
Logic Programming and Nonmonotonic Reasoning (LPNMR 2005)

Abstract

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.

This work is supported by FWO-Vlaanderen, European Framework 5 Project WASP, and by GOA/2003/08.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 5719
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 7149
Price includes VAT (Japan)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Calvanese, D., De Giacomo, G., Lenzerini, M.: Description logics for information integration. In: Kakas, A.C., Sadri, F. (eds.) Computational Logic: Logic Programming and Beyond. LNCS (LNAI), vol. 2408, pp. 41–60. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  2. Doherty, P., Łukaszewicz, W., Szalas, A.: Efficient reasoning using the local closed-world assumption. In: Cerri, S.A., Dochev, D. (eds.) AIMSA 2000. LNCS (LNAI), vol. 1904, pp. 49–58. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  3. Duschka, O., Genesereth, M., Levy, A.: Recursive query plans for data integration. J. Logic Programming 43(1), 49–73 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  4. Etzioni, O., Golden, K., Weld, D.: Sound and efficient closed-world reasoning for planning. Artificial Intelligence 89(1-2), 113–148 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  5. Grahne, G.: Information integration and incomplete information. IEEE Data Engineering Bulletin 25(3), 46–52 (2002)

    Google Scholar 

  6. Grahne, G., Mendelzon, A.: Tableau techniques for querying information sources through global schemas. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol. 1540, pp. 332–347. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  7. Halpern, J., Moses, Y.: Knowledge and common knowledge in a distributed environment. Journal of the ACM 37(3), 549–587 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  8. Lenzerini, M.: Data integration: A theoretical perspective. In: Proc. 21st PODS, pp. 233–246 (2002)

    Google Scholar 

  9. Rousset, M., Reynaud, C.: Knowledge representation for information integration. Inf. Syst. 29(1), 3–22 (2004)

    Article  Google Scholar 

  10. McCarthy, J.: Applications of circumscription to formalizing common sense knowledge. In: Lifschitz, V. (ed.) Formalizing Common Sense: Papers by John McCarthy, pp. 198–225. Ablex Publishing Corporation, New Jersey (1990)

    Google Scholar 

  11. Millstein, T., Levy, A., Friedman, M.: Query containment for data integration systems. In: Proc. 21st PODS, pp. 67–75 (2002)

    Google Scholar 

  12. Naumann, F., Freytag, J.C., Leser, U.: Completeness of integrated information sources. Information Systems 29(7), 583–615 (2004)

    Article  Google Scholar 

  13. Reiter, R.: Towards a logical reconstruction of relational database theory. In: On Conceptual Modelling, Perspectives from Artificial Intelligence, Databases, and Programming Languages, pp. 191–233 (1982)

    Google Scholar 

  14. Van Nuffelen, B., Cortés-Calabuig, A., Denecker, M., Arieli, O., Bruynooghe, M.: Data integration using ID-logic. In: Persson, A., Stirna, J. (eds.) CAiSE 2004. LNCS, vol. 3084, pp. 67–81. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cortés-Calabuig, A., Denecker, M., Arieli, O., Van Nuffelen, B., Bruynooghe, M. (2005). On the Local Closed-World Assumption of Data-Sources. In: Baral, C., Greco, G., Leone, N., Terracina, G. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 2005. Lecture Notes in Computer Science(), vol 3662. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11546207_12

Download citation

  • DOI: https://doi.org/10.1007/11546207_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28538-0

  • Online ISBN: 978-3-540-31827-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics