Abstract
The Local Closed-World Assumption (LCWA) is a generalization of Reiter’s Closed-World Assumption (CWA) for relational databases that may be incomplete. Two basic questions that are related to this assumption are: (1) how to represent the fact that only part of the information is known to be complete, and (2) how to properly reason with this information, that is: how to determine whether an answer to a database query is complete even though the database information is incomplete. In this paper we concentrate on the second issue based on a treatment of the first issue developed in earlier work of the authors. For this we consider a fixpoint semantics for declarative theories that represent locally complete databases. This semantics is based on 3-valued interpretations that allow to distinguish between the certain and possible consequences of the database’s theory.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abiteboul, S., Duschka, O.M.: Complexity of answering queries using materialized views. In: Proc. 17th PODS, pp. 254–263 (1998)
Cortés-Calabuig, A., Denecker, M., Arieli, O., Bruynooghe, M.: Representation of partial knowledge and query answering in locally complete databases. Technical Report 457, Department of Computer Science, K.U. Leuven, August 2006 (2006)
Cortés-Calabuig, Á., Denecker, M., Arieli, O., Van Nuffelen, B., Bruynooghe, M.: On the local closed-world assumption of data-sources. In: Baral, C., Greco, G., Leone, N., Terracina, G. (eds.) LPNMR 2005. LNCS, vol. 3662, pp. 145–157. Springer, Heidelberg (2005)
Denecker, M., Marek, V.W., Truszczynski, M.: Uniform semantic treatment of default and autoepistemic logics. Artificial Intelligence 143(1), 79–122 (2003)
Doherty, P., Łukaszewicz, W., Szalas, A.: Efficient reasoning using the local closed-world assumption. In: Computational Logic: Logic Programming and Beyond. LNCS, vol. 2407, pp. 49–58. Springer, Heidelberg (2000)
Etzioni, O., Golden, K., Weld, D.: Sound and efficient closed-world reasoning for planning. Artificial Intelligence 89(1-2), 113–148 (1997)
Gelfond, M., Lifschitz, V.: Logic programs with classical negation. In: Proc. 7th ICLP, pp. 579–597 (1990)
Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Generation Comput. 9(3/4), 365–386 (1991)
Grahne, G.: Information integration and incomplete information. IEEE Data Engineering Bulletin 25(3), 46–52 (2002)
Lenzerini, M.: Data integration: A theoretical perspective. In: Proc. 21st PODS, pp. 233–246 (2002)
Levy, A.Y.: Obtaining complete answers from incomplete databases. In: Proc. 22nd VLDB, pp. 402–412 (1996)
Motro, A.: Integrity = validity + completeness. ACM Trans. Database Syst. 14(4), 480–502 (1989)
Reiter, R.: Towards a logical reconstruction of relational database theory. In: Conceptual Modelling, pp. 191–233 (1982)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cortés-Calabuig, Á., Denecker, M., Arieli, O., Bruynooghe, M. (2006). Representation of Partial Knowledge and Query Answering in Locally Complete Databases. In: Hermann, M., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2006. Lecture Notes in Computer Science(), vol 4246. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11916277_28
Download citation
DOI: https://doi.org/10.1007/11916277_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-48281-9
Online ISBN: 978-3-540-48282-6
eBook Packages: Computer ScienceComputer Science (R0)