Skip to main content
SpringerLink
Log in

Embedding deductive capabilities in relational database systems

  • Published:
International Journal of Computer & Information Sciences Aims and scope Submit manuscript

Abstract

The basic idea of our work is to include deductive capabilities in a relational database system by fully using the operands of relational algebra and without using any theorem prover. We present a deductive database system where the user can formulate deduction laws as logical formulas, but which works on an underlying relational database system by fully using the data manipulation routines of such a system. Generally, it is not possible to express the deduction laws by means of expressions of relational algebra (see Ref. 1). In our system, a relational algebra expression is associated with every database deduction law. The result of its evaluation (with respect to an underlying database) is the set of all database entries that can be deduced from the database by applying the respective law once (Theorem 1). By successively applying all these relational expressions for all the database deduction laws it is possible to generate the whole extensional database (i.e. all tuples deducible from the database).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. A. V. Aho and J. D. Ullman, Universality of data retrieval languages.Proc. Sixth ACM Symp. on Principles of Programming Languages (1979).

  2. E. F. Codd, Relational completeness of database sublanguages. In: Database Systems (Rustin, Ed.), Prentice Hall (1972).

  3. F. Bancilhorn, On the completeness of Query Languages for Relational Data Bases.Proc. 7th Symp. on Math. Foundations of Comp. Sci. Zakopane, Poland. Springer, Lecture Notes and Computer Science, (1978).

    Google Scholar 

  4. A. K. Chandra, Programming Primitives for Database Languages.Conference Record of the 8th Annual ACM Symp. on Principles of Programming Languages (1981).

  5. A. K. Chandra and D. Harel, Computable queries for relational databases.Proc. 11thAnnual ACM Symp. on the Theory of Computing, pp. 309–319 (1979).

  6. M. H. Van Emden and R. A. Kowalski, The Semantics of Predicate Logic as a programming Language.J. ACM,23(4) 733–742 (1976).

    Google Scholar 

  7. R. Demolombe, Utilisation du calcul des prédicats comme langage d'interrogation des bases de données. Thèse d'Etat, Toulouse (1982).

  8. I. Futo, F. Darvas, and P. Szeredi, The application of PROLOG to the development of QA and DBM Systems. In: (Ref. 9).

  9. H. Gallaire and J. Minker, Logic and Databases Plenum Press, New York (1978).

    Google Scholar 

  10. H. Gallaire, J. Minker, and J. M. Nicolas, Advances in Database Theory. Vol. 1. Plenum Press, New York (1981).

    Google Scholar 

  11. V. Dahl, On Database Systems Development through Logic. In: ACM Transactions on Database Systems, 7(1) (March 1982).

  12. J. D. Ullman, Principles of Database Systems. Computer Science Press (1980).

  13. C. L. Chang, Symbolic Logic and Mechanical Theorem Proving. Academic Press, New York, (1973).

    Google Scholar 

  14. C. L. Chang, Further investigations of deduction in relational databases. In: (9).

  15. J. M. Nicolas, Contributions à l'étude théorique des bases de données—apports de la logique mathématique—Thèse de Doctorat d'Etat, Sciences, Toulouse, (1979).

    Google Scholar 

  16. M. M. Zloof, Query by Example: Operations on the transitive closure. JBM RC 5526, Yorktown Heights, New York (1975).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Groupe Representation and Traitement des Connaissances, Centre National de la Recherche Scientifique, 31, Chemin Joseph Aiguier, 13402, Marseille Cedex 9, France

    Camilla B. Schwind

Authors
  1. Camilla B. Schwind
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Schwind, C.B. Embedding deductive capabilities in relational database systems. International Journal of Computer and Information Sciences 13, 327–338 (1984). https://doi.org/10.1007/BF00991656

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00991656

Key words

Search

Navigation