Abstract
This chapter provides a theoretical basis for deductive database systems. A deductive database consists of a finite number of database statements, which have the form A←W, where A is an atom and W is a typed first order formula. A query has the form ←W, where W is a typed first order formula. An integrity constraint is a closed, typed first order formula. Function symbols are allowed to appear in formulas. Such a deductive database system can be implemented using a PROLOG system. The main results of this chapter are the soundness and completeness of the query evaluation process, the soundness of the implementation of integrity constraints, and a simplification theorem for implementing integrity constraints.
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.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1987 J. W. Lloyd
About this chapter
Cite this chapter
Lloyd, J.W. (1987). Deductive Databases. In: Foundations of Logic Programming. Symbolic Computation. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-83189-8_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-83189-8_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-83191-1
Online ISBN: 978-3-642-83189-8
eBook Packages: Springer Book Archive