Skip to main content

Logic for Data Description

  • Chapter

Abstract

Logic is useful both for describing static data bases as well as for processing data bases which change. Both the static and dynamic management of data bases depends upon the form of definitions: whether data is defined by means of complete if-and-only-if definitions or only by means of the if-halves, whether the only-if half of an if-and-only-if definition is stated explicitly or is assumed implicitly, and whether the only-if assumption is understood as a statement of the object language (in the data base) or as a statement of the meta-language (about the data base). Similar considerations apply to the processing of computer programs. When logic is used to describe information, the conventional distinction between data bases and programs no longer applies.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bergman, M. and Kanoui, H. [1973] Application of Mechanical Theorem Proving to Symbolic Calculus, Third International Symposium on Advanced Computing Methods in Theoretical Physics, C.N.R.S., Marseille, June 1973.

    Google Scholar 

  2. Chang, C. L., [1976] DEDUCE: A Deductive Query Language for Relational Data Bases, In Pattern Recognition and Artificial Intelligence (C. H. Chen, Ed.), Academic Press, Inc., New York, 1976, 108–134.

    Google Scholar 

  3. Clark, K. L., Tarnlund, S. A. [1977] A First Order Theory of Data and Programs, Proceedings IFIP 77, North-Holland, 1977, 939–944.

    Google Scholar 

  4. Clark, K. L. [1978] Negation as Failure, In Logic and Data Bases (H. Gallaire and J. Minker, Eds.), Plenum Press, New York, 1978, 293–322.

    Google Scholar 

  5. Codd, E. F. [1970] A Relational Model for Large Shared Data Bases, CACM 13, 6 (June 1970), 377–387.

    MATH  Google Scholar 

  6. Codd, E. F. [1972] Relational Completeness of Data Base Sublanguages, In Data Base Systems (R. Rustin, Ed.), Prentice-Hall, Englewood Cliffs, N.J., 1972, 65–98.

    Google Scholar 

  7. Darlington, J. L. [1969] Theorem Proving and Information Retrieval, In Machine Intelligence 4 (B. Meltzer and D. Michie, Eds.), American Elsevier Publishing Co., Inc. New York, 1969.

    Google Scholar 

  8. Deliyanni, A. and Kowalski, R. A. [1977] Logic and Semantic Networks, Department of Computing and Control Research Report, Imperial College, London, June 1977. Also Proceedings of the Workshop on Logic and Data Bases, Toulouse, November 1977.

    Google Scholar 

  9. Futo, I., Szeredi, P., and Darvas, F. [1977] Some Implemented and Planned PROLOG Applications, Workshop of Logic and Data Bases, Toulouse, November 1977.

    Google Scholar 

  10. Gallaire, H., Minker, J. and Nicolas, J.M. [1978] An Overview and Introduction to Logic and Data Bases, In Logic and Data Bases (H. Gallaire and J. Minker, Eds.). Plenum Press, New York, 1978, 3–30.

    Google Scholar 

  11. Gallaire, H. and Minker, J., Editors [1978] Logic and Data Bases, Plenum Press, New York, 1978.

    Google Scholar 

  12. Green, C. [1969] Theorem-Proving by Resolution as a Basis for Question Answering Systems, In Machine Intelligence 4 (B. Meltzer and D. Michie, Eds.), American Elsevier Publishing Co., Inc., New York, 1969, 183–205.

    Google Scholar 

  13. Kellogg, C., Klahr, P., Travis, L. [1978] Deductive Planning and Pathfinding for Relational Data Bases, In Logic and Data Bases (H. Gallaire and J. Minker, Eds.), Plenum, N.Y., 179–200.

    Google Scholar 

  14. Kowalski, R. A. [1974] Logic for Problem-Solving, Memo No. 75, Department of Computational Logic, University of Edinburgh, 1974.

    Google Scholar 

  15. Kowalski, R. A. [1976] Algorithm = Logic + Control, Research Report, Department of Computing and Control, Imperial College, London, 1976.

    Google Scholar 

  16. Minker, J. [1975] Performing Inferences over Relational Data Bases, Proceedings of 1975 ACM SIGMOD International Conference on Management of Data, 1975, 79–91.

    Google Scholar 

  17. Minsky, M. [1975] A Framework for the Representation of Knowledge, In The Psychology of Computer Vision (P. Winsont, Ed.), McGraw Hill, New York, 1975, 211–280.

    Google Scholar 

  18. Nicolas, J. M. and Syre, J. C. [1974] Natural Question Answering and Automatic Deduction in the System SYNTEX, Proceedings IFIP Congress 1974, North Holland Publishing Co., Stockholm, Sweden, August 1974.

    Google Scholar 

  19. Nicolas, J. M. and Gallaire, H. [1978] Data Base: Theory vs. Interpretation, In Logic and Data Bases (H. Gallaire and J. Minker, Eds.), Plenum Press, New York, 1978, 33–54.

    Google Scholar 

  20. Pirotte, A. [1978] High Level Data Base Query Languages, In Logic and Data Bases (H. Gallaire and J. Minker, Eds.), Plenum Press, New York, 1978, 409–436.

    Google Scholar 

  21. Reiter, R. [1978] On Closed World Data Bases, In Logic and Data Basest. (H. Gallaire and J. Minker, Eds.), Plenum Press, New York, 1978, 55–76.

    Google Scholar 

  22. Reiter, R. [1978] Deductive Question-Answering on Relational Data Bases, In Logic and Data Bases (H. Gallaire and J. Minker, Eds.), Plenum Press, New York, 1978, 149–177.

    Google Scholar 

  23. Roussel, P. [1975] PROLOG: Manuel de Reference et d’Utilisation, Groupe d’Intelligence Artificielle, U.E.R. de Luminy, Université dfAix-Marseule, Sept. 1975.

    Google Scholar 

  24. van Emden, M. H. [1979] Computation and Deductive Information Retrieval, In Formal Description of Programming- Concepts (E. Neuhold, Ed.), North-Holland, to be published.

    Google Scholar 

  25. Zloof, M. M. [1975] Query-by-Example, Proceedings AFIPS 1975 NCC., Vol 44, AFIPS Press, Montvale, N. J., 1975, 431–348.

    Google Scholar 

  26. Zloof, M. M. and deLong, S. P. [1977] The System for Business Automation (SBA): Programming Language, CACM 20, 6 (June 1977), 385–396.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1978 Plenum Press, New York

About this chapter

Cite this chapter

Kowalski, R. (1978). Logic for Data Description. In: Gallaire, H., Minker, J. (eds) Logic and Data Bases. Springer, Boston, MA. https://doi.org/10.1007/978-1-4684-3384-5_4

Download citation

  • DOI: https://doi.org/10.1007/978-1-4684-3384-5_4

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4684-3386-9

  • Online ISBN: 978-1-4684-3384-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics