Skip to main content

Update semantics under the domain closure assumption

Contributed Papers

Part of the Lecture Notes in Computer Science book series (LNCS,volume 243)

Abstract

The problem addressed in this paper is the characterization of the database state which results from an update. To reach this goal, we suppose that some transition constraints may be expressed.

We also assume that the set of objects which are manipulated in the database is finite, and the considered operation is not a domain modification.

Finally, we aim to define the update semantics in such a way that an update on two equivalent states leads to two equivalent resulting states.

The operations we consider are not restricted to facts, and may concern more general information.

Keywords

  • Normal Form
  • Database State
  • Frame Problem
  • Modal Formula
  • Variable Symbol

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 work was supported by the DRET under contract no 86002.08.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/3-540-17187-8_33
  • Chapter length: 18 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   89.00
Price excludes VAT (USA)
  • ISBN: 978-3-540-47346-6
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   119.00
Price excludes VAT (USA)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. J. Mc CARTHY, P. HAYES: "Some philosophical problems from the standpoint or artificial intelligence", Machine Intelligence, no 4, 1969, The University Press

    Google Scholar 

  2. CASTILHO, CASANOVA, FURTADO: "A temporal frameworks for database specifications", Proc. VLD8, 1982

    Google Scholar 

  3. C. CHANG, R. LEE: "Symbolic logic and mechanical theorem proving", Academic Press

    Google Scholar 

  4. L. CHOLVY: "A modal approach to update semantics problem", Submitted to DS2

    Google Scholar 

  5. L. CHOLVY, K. YAZDANIAN: "Bases de données relationnelles et modélisation des actions", Rapport DERI no 2/3245, 1986

    Google Scholar 

  6. H.D. EHRICH, U.W. LIPECK, M. GOGELLA: "Specification, semantics and enforcement of dynamic database constraints", Proc. VLDB 1984

    Google Scholar 

  7. L. FARINAS DEL CERRO: "A simple deduction method for modal logic", Information Processing Letters, vol. 14 no 2, april 1982

    Google Scholar 

  8. L. FARINAS DEL CERRO: "MOLOG: a system that extends PROLOG with modal logic"

    Google Scholar 

  9. L. FARINAS DEL CERRO: "Resolution modal logic", Logique et analyse, Juinseptembre 1985.

    Google Scholar 

  10. R. FAGIN, J.D. ULLMAN, M.Y. VARDI: "On the semantics of updates in databases", Proc. ACM RODS 1983

    Google Scholar 

  11. H. GALLAIRE, J. MINKER, J.-M. NICOLAS: "Logic and databases: a deductive approach", Computer Surveys, vol. 16 no 2

    Google Scholar 

  12. G.E. HUGHES, M.J. CRESSWELL: "An introduction to modal logic", Methren London and New York

    Google Scholar 

  13. G.M. KUPPER, J.D. ULLMAN, M.Y. VARDI: "On the equivalence of logical databases", Internal Report

    Google Scholar 

  14. D.W. LOVELAND: "Automated theorem proving. A logical basis", North Holland, 1978

    Google Scholar 

  15. Z. MANNA, A. PNUELI: "The modal logic of programs", Lecture notes in Computer Science no 71, 1979

    Google Scholar 

  16. J.-M. NICOLAS: "Contributions à l'étude théorique des bases de données: apports de la logique mathématique", Thèse ENSAE, Toulouse, 1979

    Google Scholar 

  17. J.-M. NICOLAS, K. YAZDANIAN: "An outline of BDGEN", Proc. of IFIP 1983

    Google Scholar 

  18. R. REITER: "Towards a logical reconstruction of relational database theory on conceptual modelling", Springer Verlag

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cholvy, L. (1986). Update semantics under the domain closure assumption. In: Ausiello, G., Atzeni, P. (eds) ICDT '86. ICDT 1986. Lecture Notes in Computer Science, vol 243. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-17187-8_33

Download citation

  • DOI: https://doi.org/10.1007/3-540-17187-8_33

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-17187-4

  • Online ISBN: 978-3-540-47346-6

  • eBook Packages: Springer Book Archive