Abstract
“Closed world assumptions” (CWAs) are an important class of implicit completions for logic databases. We present a new general definition of CWA; it is parameterized, so that known and new versions of CWAs can be derived as special cases. Our CWA, in turn, instantiates the more basic notion of “database completion” and satisfies natural properties. It can even be characterized by the property of determining maximal completions without generating too much new information. We study syntactic as well as semantic definitions and prove them to be equivalent. By discussing several instances of CWAs we demonstrate the applicability of our framework to database specification.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
H. Bidoit and R. Hull. Positivism vs. minimalism in deductive databases. In Proc. of the Fifth ACM SIGACT-SIGMOD Symposium on Principles of Database Systems (PODS), 123–132, 1986.
S. Brass. Vervollständigungen für Logikdatenbanken (completions of logic databases). Diploma Thesis, Informatics, Techn. Univ. Braunschweig, 1988. In German.
H.B. Enderton. A Mathematical Introduction to Logic. Academic Press, New York, 1972.
H. Gallaire, J. Minker, and J.-M. Nicolas. Logic and databases: A deductive approach. Computing Surveys (16), 153–185, 1984.
M. Gelfond and H. Przymusinska. Negation as failure: Careful closure procedure. Artificial Intelligence (30), 273–287, 1986.
M. Gelfond, H. Przymusinska, and T. Przymusinski. The extended closed world assumption and its relationship to parallel circumscription. In Proc. of the Fifth ACM SIGACT-SIGMOD Symposium on Principles of Database Systems (PODS), 153–185, 1986.
E. Mendelson. Introduction to Mathematical Logic. Van Nostrand-Reinhold, New York, second edition, 1978.
J. Minker. On indefinite databases and the closed world assumption. In D. W. Loveland, editor, 6th Conference on Automated Deduction, 292–308, Springer-Verlag, Berlin, 1982. Lecture Notes in Computer Science No.138.
J. Minker, editor. Foundations of Deductive Databases and Logic Programming, Morgan Kaufmann Publishers, Los-Altos (Calif.), 1988.
J. Minker and D. Perlis. Applications of protected circumscription. In R. E. Shostak, editor, 7th International Conference on Automated Deduction, 414–425, Springer-Verlag, Berlin, 1984. Lecture Notes in Computer Science No.170.
J. Minker and D. Perlis. Computing protected circumscription. The Journal of Logic Programming (2), 235–249, 1985.
R. Reiter. On closed world data bases. In H. Gallaire and J. Minker, editors, Logic and Data Bases, 55–76, Plenum, New York, 1978.
R. Reiter. A logic for default reasoning. Artificial Intelligence (13), 81–132, 1980.
J. C. Sheperdson. Negation in logic programming. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, 19–88, Morgan Kaufmann Publishers, Los-Altos (Calif.), 1988.
A. Yahya and L. J. Henschen. Deduction in non-horn databases. Journal of Automated Reasoning (1), 141–160, 1985.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brass, S., Lipeck, U.W. (1989). Specifying closed world assumptions for logic databases. In: Demetrovics, J., Thalheim, B. (eds) MFDBS 89. MFDBS 1989. Lecture Notes in Computer Science, vol 364. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51251-9_6
Download citation
DOI: https://doi.org/10.1007/3-540-51251-9_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51251-6
Online ISBN: 978-3-540-46182-1
eBook Packages: Springer Book Archive