Abstract
In recent years several research efforts have concentrated on describing databases as first-order logical languages. There are two expectations of this exercise. Firstly, that it allows theoretical investigations of the properties of database systems. Secondly, that extending database query languages to first-order logic would yield powerful systems. This paper presents a brief survey of the field of logic and databases. Some discussion of advantages and disadvantages is given.
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
Aho, A., J. Ullman, “Universality of Data Retrieval Languages”, Sixth ACM Symposium on Principles of Programming Languages, 1979.
Brachman R.J. and H.J. Levesque, “What Makes a Knowledge Base Knowledgeable? A View of Databases from the Knowledge Level”, Proceedings of the First International Workshop on Expert Database Systems, Kiawah Island, SC, USA, October, 1984.
Campbell, J., Implementations of Prolog, (ed. J. Campbell ), Ellis Horwood Series in Artificial Intelligence, 1984.
Chandra, A.K., D. Harel, “Computable Queries for Relational Databases”, in Proc. 11th. Sym. on Theory of Computing, 1979.
Clark, K., “Negation as Failure”, in [GM78], 1978.
Codd, E.F., “Relational Completeness of Database Sublanguages”, Data Base Systems (Ed. R. Rustin ), Prentice Hall, 1972.
Gallaire, H. and Minker, J. (eds.), Logic and Data Bases. New York, Plenum Press, 1978.
Gallaire, H., J. Nicolas, J. Minker, Advances in Database Theory, Vol. 1, Plenum Press, New York 1981.
Gallaire, H.,J. Minker, J. Nicolas, Advances in Database Theory, Plenum Press, Vol. 2, 1984.
Henschen, L. J. and S. A. Naqvi, “On compiling queries in recursive first-order databases”, J. ACM, Vol. 31, No. 1, pp. 47–85, January, 1984.
Konolige, K., “A Metalanguage Representation of Relational Databases for Deductive Question-Answering Systems”, in Conf on Very Large Databases, Montreal, 1981.
Kowalski, R., Logic for Problem Solving, Elsevier, 1979.
McCarthy, J., “Circumscription, A Form of Non-Monotonic Reasoning”, Artificial Intelligence 13, 1980.
Minker, J., “On Indefinite Databases and the Closed World Assumption”, Univ. of Maryland Technical Report No. 1076, 1981.
Naqvi, S., Some Extensions to the Closed World Assumption, submitted for publication.
Reiter, R., “An Approach to Deductive Question-Answering”, BBN tech. report no. 3649.
Reiter, R., Equality and Domain Closure in First-Order Databases, J. of the ACM 27, 2, 1980.
Reiter, R., “Circumscription Implies Predicate Completion (Sometimes)”, Proc. of AAAI Conf, Pittsburgh 1982.
Ullman, J.D., Principles of Database Systems, Computer Science Press 1983.
Warren, D., “Implementing Prolog —Compiling Predicate Logic Programs”, University of Edinburgh, DAI report nos. 39 and 40, 1977.
Yahya, A., L. Henschen, “Deduction in Non-Horn Databases”, Journal of Automated Reasoning, 1, No. 2, 1985.
Zloof, M. M., “Query-by-Example: A Data Base Language”, IBM Systems Journal, 16, 4, 1977 (pp. 324–343 ).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1986 Springer-Verlag New York Inc.
About this chapter
Cite this chapter
Naqvi, S.A. (1986). A Brief Survey of Logic and Database Systems. In: Brodie, M.L., Mylopoulos, J. (eds) On Knowledge Base Management Systems. Topics in Information Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-4980-1_21
Download citation
DOI: https://doi.org/10.1007/978-1-4612-4980-1_21
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-9383-5
Online ISBN: 978-1-4612-4980-1
eBook Packages: Springer Book Archive