Monadic databases with equality

  • Dimitri Theodoratos
Part of the Lecture Notes in Computer Science book series (LNCS, volume 495)


Monadic logic with equality (a restriction of first order logic with equality to a language having only unary predicate symbols) can be used to define deductive databases called monadic databases with equality (ME-databases). ME-databases allow us to model positive information (there exists an object having certain properties), unique positive information (there exists only one object having certain properties), negative information (the negation of a positive information) and rules (every object having certain properties has also some other properties). The originality of this approach is that domain elements are represented by unary predicate symbols and not as constant symbols. We provide a formal system for ME-databases and we prove its soundness and completeness. We give also polynomial algorithms for evaluating elementary queries corresponding to the implication problem on ME-databases.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [A74]
    W.W. Armstrong, Dependency structures of database relationships, Proc. IFIP 74, pp 580–583, North Holland, Amsterdam.Google Scholar
  2. [ArM86]
    H. Arisawa, T. Miura. On the properties of extended inclusion dependencies. Proc. of the 12th International conf. on Very Large Databases, Kyoto, 1986.Google Scholar
  3. [AtP86]
    Paolo Atzeni, D. Stott Parker Jr, Formal properties of net-based knowledge representation schemes, Proc. 2nd Int. Conf. on Data Engineering, Los Angeles, 1986Google Scholar
  4. [AtP87]
    Paolo Atzeni, D. Stott Parker Jr, Set containment Inference, Proc. of the ICDT, Sep. 1986, Roma, Italy, LNCS No 243, Springer-Verlag,1987Google Scholar
  5. [AtP90]
    Paolo Atzeni, D. Stott Parker Jr, Algorithms for set-containment inference, Advances in Database Programming Languages, Eds: F. Bancilhon, P. Buneman, ACM Press, Frontier Series, 1990Google Scholar
  6. [BeB79]
    C. Beeri, P. Berstein, Computational problems related to the design of normal form relational schemas, ACM Trans. Database Syst. 4,1 Mar. 1979.Google Scholar
  7. [BoJ80]
    G. Boolos, R. Jeffrey, Computability and logic — 2nd ed., Cambridge University Press, 1980.Google Scholar
  8. [BeV84]
    C. Beeri, M.Y. Vardi. Formal systems for tuple and equality Generating dependencies. SIAM J. Comput. Vol 13, No 1, February 1984.Google Scholar
  9. [CKS86]
    Cosmadakis S., Kanellakis P., Spyratos N. Partition semantics of relations. JCSS, 33:2, 1986.Google Scholar
  10. [F82]
    R. Fagin, Horn clauses and databases dependencies, journal of ACM, Oct. 1982.Google Scholar
  11. [G86]
    J. Gallier, Logic for Computer Science: Foundations of Automatic Theorem Proving. Harper & Row, Publishers, 1986.Google Scholar
  12. [L87]
    C. Lecluse, Une sémantique ensembliste pour les bases de données — application au modèle relationnel. Thèse de troisième cycle, Université de Paris — Sud, Mars 1987.Google Scholar
  13. [Le87]
    Maurizio Lenzerini, Covering and disjointness Constraints in Type Networks Proc. 3rd Int. IEEE Conf. on Data Engineering, Los Angeles 1987.Google Scholar
  14. [Le90]
    Maurizio Lenzerini, Class Hierarchies and their Complexity, Advances in Database Programming Languages, Eds: F. Bancilhon, P. Buneman, ACM Press, 1990Google Scholar
  15. [LS87a]
    C. Lecluse and N. Spyratos, Incorporating Functional Dependencies in Deductive Query Answering, IEEE International conference on Data Engineering, Los Angeles, February 1987.Google Scholar
  16. [LS87b]
    C. Lecluse and N. Spyratos, Deductive Databases and Monadic Logic, LRI, internal Research Report, 1987.Google Scholar
  17. [M83]
    D. Maier, The theory of relational Databases, Computer Science Press, 1983Google Scholar
  18. [R78]
    R. Reiter. On closed world databases. In Logic and databases. H. Gallaire and J. Minker, Plenum Press, New York, 1978.Google Scholar
  19. [R84]
    R.Reiter, Towards a Logical Reconstruction of Relational Database Theory. In On conceptual modeling, Brodie, Mylopoulos and Schmidt, Springer-Verlag, 1984.Google Scholar
  20. [S84]
    N. Spyratos, The partition model, a deductive database model, ACM TODS, March 1987. Also in INRIA Research Report no 286, April 1984.Google Scholar
  21. [T89]
    D. Theodoratos, Monadic Databases, Proc. ICNTSSD'89, Caracas, November 1989.Google Scholar
  22. [T91]
    D. Theodoratos, Monadic Databases with Equality and Typed Monadic Databases with Equality, L.R.I. Research Report, Université de Paris Sud, Orsay, 1991.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Dimitri Theodoratos
    • 1
  1. 1.Université de Paris-SudOrsay cedexFrance

Personalised recommendations