Abstract
A system of nonmonotonic reasoning, called subimplication, has been defined in Bossu and Siegel [1981]. In this chapter we show that it is possible to set up a logical model of databases using subimplication and two sets of stable formulas. This model allows the construction of a system for creating, updating and querying databases that is totally transparent to the user.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bossu, G. and Siegel, P. [1981], “La saturation au secours de la non-monotonie”. These de 3eme cycle. Universite d’Aix-Marseille II.
Clocksin, W. F. and Mellish, C. S. [1981]. Programming-in Prolog ,Springer-Verlag, Berlin-Heidelberg-New York, 1981.
Dipaola, R. A. [1971]. “The relational data file and the decision problem for classes of proper formula”. Report R-661-PR, RAND Corporation.
Kowalski, R. A. and Van Emdem, M. H. [1976] “The semantics of predicate logic as a programming language”. J. ACM 23 ,4 (October 1976) 733–742.
Lyndon, R. C. [1964] Notes on Logic ,(October 1976), (Van Nostrand Mathematical Studies).
McCarthy, J. [1980] “Circumscription. A form of nonmonotonic reasoning”. Artificial Intelligence Journal 13 (1980) 27–39.
Minker, J. [1982] “On Indefinite Data and the Closed World Assumption”, Proceedings Conference on Automated Deduction (D. Loveland, Ed.), New York, 292–308.
Minker, J. [1983] “On Theories of Definite and Indefinite Databases”. Technical Report, University of Maryland, College Park, Maryland 20742.
Nicolas, J. M. [1979] “Contribution a 1’etude theorique des bases de donnees”, Apports de la logique mathematique, These d’etat. ONERA-CERT (Toulouse, 1979).
Nicolas, J. M. and Demolombe, R. [1982] “On the Stability of Relational Queries”, Workshop Logical Bases for Databases, Toulouse (Decembre 1982).
Reiter, R. [1978]. “On closed world data bases”. In: Logic and Data Bases (Gallaire, H. and Minker, J., Eds.), Plenum Press, New York, 55–76.
Reiter, R. [1980] “A logic for default reasoning,” Artificial Intelligence Journal 13 (1980) 81–132.
Robinson, J. A. [1965] “A Machine Oriented Logic Based on the Resolution Principle”, J. ACM 12 (January 1965) 23–41.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1984 Plenum Press, New York
About this chapter
Cite this chapter
Bossu, G., Siegel, P. (1984). Nonmonotonic Reasoning and Databases. In: Gallaire, H., Minker, J., Nicolas, J.M. (eds) Advances in Data Base Theory. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-9385-0_9
Download citation
DOI: https://doi.org/10.1007/978-1-4615-9385-0_9
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4615-9387-4
Online ISBN: 978-1-4615-9385-0
eBook Packages: Springer Book Archive