Advertisement

Expressiveness of semipositive logic programs with value invention

  • Luca Cabibbo
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1154)

Abstract

We study the expressive power of the relational query language WILOG1/2,⌝ of semipositive datalog programs extended with a mechanism of safe value invention. We adopt a semantics for value invention based on the use of Skolem functor terms. We show that this language expresses exactly the class of semimonotone queries, that is, the class of computable queries that are preserved under extensions.

Keywords

Active Domain Query Language Total Order Expressive Power Partial Enumeration 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    S. Abiteboul and V. Vianu. Datalog extensions for database queries and updates. Journal of Computer and System Science, 43(1):62–124, August 1991.Google Scholar
  2. 2.
    F. Afrati, S. Cosmadakis, and M. Yannakakis. On Datalog vs. polynomial time. In Tenth ACM SIGACT SIGMOD SIGART Symp. on Principles of Database Systems, pages 13–25, 1991.Google Scholar
  3. 3.
    L. Cabibbo. On the power of stratified logic programs with value invention for expressing database transformations. In ICDT'95 (Fifth International Conference on Data Base Theory), Prague, Lecture Notes in Computer Science 893, pages 208–221, 1995.Google Scholar
  4. 4.
    L. Cabibbo. The expressive power of stratified logic programs with value invention. Technical Report n. RT-INF-11-1996, Dipartimento di Discipline Scientifiche, Università degli Studi di Roma Tre, 1996. Submitted to Information and Computation.Google Scholar
  5. 5.
    L. Cabibbo. Querying and Updating Complex-Object Databases. PhD thesis, Università degli Studi di Roma “La Sapienza”, 1996.Google Scholar
  6. 6.
    A.K. Chandra and D. Harel. Computable queries for relational databases. Journal of Computer and System Science, 21:333–347, 1980.Google Scholar
  7. 7.
    C.A. Gunter and D.S. Scott. Semantic domains. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 633–674. Elsevier Science Publishers (North-Holland), Amsterdam, 1990.Google Scholar
  8. 8.
    R. Hull and J. Su. Untyped sets, invention, and computable queries. In Eigth ACM SIGACT SIGMOD SIGART Symp. on Principles of Database Systems, pages 347–359, 1989.Google Scholar
  9. 9.
    R. Hull and J. Su. Algebraic and calculus query languages for recursively typed complex objects. Journal of Computer and System Science, 47(1):121–156, August 1993.Google Scholar
  10. 10.
    R. Hull and J. Su. Deductive query languages for recursively typed complex objects. Technical report, University of Southern California, 1993.Google Scholar
  11. 11.
    R. Hull and M. Yoshikawa. ILOG: Declarative creation and manipulation of object identifiers. In Sixteenth International Conference on Very Large Data Bases, Brisbane, pages 455–468, 1990.Google Scholar
  12. 12.
    R. Hull and M. Yoshikawa. On the equivalence of database restructurings involving object identifiers. In Tenth ACM SIGACT SIGMOD SIGART Symp. on Principles of Database Systems, pages 328–340, 1991.Google Scholar
  13. 13.
    N. Immerman. Relational queries computable in polynomial time. Information and Control, 68:86–104, 1986.Google Scholar
  14. 14.
    P.G. Kolaitis. The expressive power of stratified logic programs. Information and Computation, 90(1):50–66, January 1991.Google Scholar
  15. 15.
    P.G. Kolaitis and M. Vardi. On the expressive power of Datalog: Tools and a case study. In Ninth ACM SIGACT SIGMOD SIGART Symp. on Principles of Database Systems, pages 61–71, 1990.Google Scholar
  16. 16.
    G.M. Kuper and M.Y. Vardi. The logical data model. ACM Trans. on Database Syst., 18(3):379–413, September 1993.Google Scholar
  17. 17.
    D. Maier. A logic for objects. In Workshop on Foundations of Deductive Database and Logic Programming (Washington, D.C. 1986), pages 6–26, 1986.Google Scholar
  18. 18.
    C. Papadimitriou. A note on the expressive power of prolog. Bulletin of the EATCS, 26:21–23, 1985.Google Scholar
  19. 19.
    J. Van den Bussche. Formal Aspects of Object Identity in Database Manipulation. PhD thesis, University of Antwerp, 1993.Google Scholar
  20. 20.
    J. Van den Bussche, D. Van Gucht, M. Andries, and M. Gyssens. On the completeness of object-creating query languages. In 33rd Annual Symp. on Foundations of Computer Science, pages 372–379, 1992.Google Scholar
  21. 21.
    M. Vardi. The complexity of relational query languages. In Fourteenth ACM SIGACT Symp. on Theory of Computing, pages 137–146, 1988.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Luca Cabibbo
    • 1
  1. 1.Dipartimento di Discipline Scientifiche: Chimica e InformaticaUniversità degli Studi di Roma TreRomaItaly

Personalised recommendations