Skip to main content
SpringerLink
Log in

On the power of stratified logic programs with value invention for expressing database transformations

  • Contributed Papers
  • Conference paper
  • First Online:
Database Theory — ICDT '95 (ICDT 1995)

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

Included in the following conference series:

Abstract

The expressive power of the family of ILOG(−) languages is investigated. The languages are rule based, with value invention and stratified negation. The chosen semantics for value invention is based on Skolem functor terms. We show that, in presence of value invention, the whole expressive power is achieved using programs made of two strata, and that ILOG≠ (i.e., the class of programs with non-equality and without negation) express the downward monotone list constructive transformations.

This work was partially supported by MURST, within the Project “Metodi formali e strumenti per basi di dati evolute”, and by Consiglio Nazionale delle Ricerche, within “Progetto Finalizzato Sistemi Informatici e Calcolo Parallelo, Obiettivo LOGIDATA+”.

The author would like to thank Jan Van den Bussche for the fruitful discussions on the subject of this paper.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Abiteboul and P. Kanellakis. Object identity as a query language primitive. In ACM SIGMOD International Conf. on Management of Data, pages 159–173, 1989.

    Google Scholar 

  2. S. Abiteboul and V. Vianu. Datalog extensions for database queries find updates. Journal of Comp. and System Sc., 43(1):62–124, August 1991.

    Google Scholar 

  3. 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 

  4. K. Apt. Logic programming. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, pages 493–574. Elsevier Science Publishers (North-Holland), Amsterdam, 1990.

    Google Scholar 

  5. P. Atzeni, L. Cabibbo, and G. Mecca. IsaLog: A declarative language for complex objects with hierarchies. In Ninth IEEE Int. Conf. on Data Engineering, pages 219–228, 1993.

    Google Scholar 

  6. L. Cabibbo. On the power of stratified logic programs with value invention for expressing database transformations. Technical report, Dip. di Informatica e Sistemistica, Universita di Roma “La Sapienza”, 1994.

    Google Scholar 

  7. A.K. Chandra and D. Harel. Computable queries for relational databases. Journal of Comp. and System Sc., 21:333–347, 1980.

    Google Scholar 

  8. E.F. Codd. A relational model for large shared data banks. Communications of the ACM, 13(6):377–387, 1970.

    Google Scholar 

  9. M.R. Garey and D.S. Johnson. Computers and Intractability. W.H. Freeman and Company, San Francisco, 1979.

    Google Scholar 

  10. M. Gyssens, J. Paredaens, and D. Van Gucht. A graph-oriented object database model. In Ninth ACM SIGACT SIGMOD SIGART Symp. on Principles of Database Systems, pages 417–424, 1990.

    Google Scholar 

  11. R. Hull and J. Su. Algebraic and calculus query languages for recursively typed complex objects. Journal of Comp. and System Sc., 47(1):121–156, August 1993.

    Google Scholar 

  12. R. Hull and J. Su. Deductive query languages for recursively typed complex objects. Technical report, University of Southern California, 1993.

    Google Scholar 

  13. R. Hull and M. Yoshikawa. ILOG: Declarative creation and manipulation of object identifiers. In Sixteenth Int. Conf. on Very Large Data Bases, pages 455–468, 1990.

    Google Scholar 

  14. P.G. Kolaitis. The expressive power of stratified logic programs. Information and Computation, 90(1):50–66, January 1991.

    Google Scholar 

  15. J. Van den Bussche. Formal Aspects of Object Identity in Database Manipulation. PhD thesis, University of Antwerp, 1993.

    Google Scholar 

  16. 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 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica e Sistemistica, Universita di Roma “La Sapienza”, Via Salaria 113, 1-00198, Roma, Italy

    Luca Cabibbo

Authors
  1. Luca Cabibbo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Georg Gottlob Moshe Y. Vardi

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cabibbo, L. (1995). On the power of stratified logic programs with value invention for expressing database transformations. In: Gottlob, G., Vardi, M.Y. (eds) Database Theory — ICDT '95. ICDT 1995. Lecture Notes in Computer Science, vol 893. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58907-4_17

Download citation

  • DOI: https://doi.org/10.1007/3-540-58907-4_17

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58907-5

  • Online ISBN: 978-3-540-49136-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation