An algorithm for determining database consistency under the closed world assumption
- 17 Downloads
It is well-known that there are circumstances where applying Reiter's closed world assumption (CWA) will lead to logical inconsistencies. In this paper, a new characterization of the CWA consistency is pesented and an algorithm is proposed for determining whether a datalase without function symbols is consistent with the CWA. The algorithm is shown to be efficient.
KeywordsMinimal Model Sequential Machine Ground Atom Deductive Database State Subset
Unable to display preview. Download preview PDF.
- Reiter, R., On Closed World Data Bases. in Logic and Databases (H. Gallaire and J. Minker, Eds.), Plenum, New York, 1978, 55–76.Google Scholar
- Shepherdson, J. C., Negation in Logic Programming. in Foundations of Deductive Databases and Logic Programming (J. Minker, Ed.). Morgan Kaufmann Publishers, Los Altos, CA, 1988, 19–88.Google Scholar
- van Emden, M. H., Computation and Deductive Information Retrieval. in Formal Description of Programming Concepts (E. Neuhold, Ed.). North-Holland, Armsterdam, 1978, 421–440.Google Scholar
- Ahc, A. V., Hopcroft, J. E. and Ullman, J. D., The Design and Analysis of Computer Algorithm. Addison-Wesley Publishing Company, 1976.Google Scholar