Update semantics under the domain closure assumption

  • Laurence Cholvy
Contributed Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 243)


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.


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [CAHA]
    J. Mc CARTHY, P. HAYES: "Some philosophical problems from the standpoint or artificial intelligence", Machine Intelligence, no 4, 1969, The University PressGoogle Scholar
  2. [CCF]
    CASTILHO, CASANOVA, FURTADO: "A temporal frameworks for database specifications", Proc. VLD8, 1982Google Scholar
  3. [CHLE]
    C. CHANG, R. LEE: "Symbolic logic and mechanical theorem proving", Academic PressGoogle Scholar
  4. [CHOL]
    L. CHOLVY: "A modal approach to update semantics problem", Submitted to DS2Google Scholar
  5. [CHYA]
    L. CHOLVY, K. YAZDANIAN: "Bases de données relationnelles et modélisation des actions", Rapport DERI no 2/3245, 1986Google Scholar
  6. [ELG]
    H.D. EHRICH, U.W. LIPECK, M. GOGELLA: "Specification, semantics and enforcement of dynamic database constraints", Proc. VLDB 1984Google Scholar
  7. [FARI1]
    L. FARINAS DEL CERRO: "A simple deduction method for modal logic", Information Processing Letters, vol. 14 no 2, april 1982Google Scholar
  8. [FARI2]
    L. FARINAS DEL CERRO: "MOLOG: a system that extends PROLOG with modal logic"Google Scholar
  9. [FARI3]
    L. FARINAS DEL CERRO: "Resolution modal logic", Logique et analyse, Juinseptembre 1985.Google Scholar
  10. [FUV]
    R. FAGIN, J.D. ULLMAN, M.Y. VARDI: "On the semantics of updates in databases", Proc. ACM RODS 1983Google Scholar
  11. [GMN]
    H. GALLAIRE, J. MINKER, J.-M. NICOLAS: "Logic and databases: a deductive approach", Computer Surveys, vol. 16 no 2Google Scholar
  12. [HUCR]
    G.E. HUGHES, M.J. CRESSWELL: "An introduction to modal logic", Methren London and New YorkGoogle Scholar
  13. [KUV]
    G.M. KUPPER, J.D. ULLMAN, M.Y. VARDI: "On the equivalence of logical databases", Internal ReportGoogle Scholar
  14. [LOVE]
    D.W. LOVELAND: "Automated theorem proving. A logical basis", North Holland, 1978Google Scholar
  15. [MAPN]
    Z. MANNA, A. PNUELI: "The modal logic of programs", Lecture notes in Computer Science no 71, 1979Google Scholar
  16. [NICO]
    J.-M. NICOLAS: "Contributions à l'étude théorique des bases de données: apports de la logique mathématique", Thèse ENSAE, Toulouse, 1979Google Scholar
  17. [NIYA1]
    J.-M. NICOLAS, K. YAZDANIAN: "An outline of BDGEN", Proc. of IFIP 1983Google Scholar
  18. [REIT]
    R. REITER: "Towards a logical reconstruction of relational database theory on conceptual modelling", Springer VerlagGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Laurence Cholvy
    • 1
  1. 1.ONERA-CERT-DERIToulouse CedexFrance

Personalised recommendations