Skip to main content
SpringerLink
Log in

About boundedness for some datalog and DATALOGneg programs

  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1992 (MFCS 1992)

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

  • 137 Accesses

Abstract

We prove that boundedness is decidable for uniformly connected Datalog programs. We then try to extend the study of boundedness to DATALOGneg programs: this implies a study of various semantics (cumulative, nondeterministic and stratified) for DATALOGneg programs. Most of the decidability results do not however generalize to DATALOGneg programs.

Support from the PRC Mathématiques-Informatique is gratefully acknowledged.

Support from the CNPq and the CEFI is gratefully acknowledged.

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. K. Apt, H. Blair, A. Walker, Towards a theory of declarative knowledge, in Foundations of Deductive DataBases and Logic Programming, J. Minker Ed., Morgan-Kaufman, Los Altos (1988), 89–148.

    Google Scholar 

  2. S. Abiteboul, Boundedness is undecidable for Datalog programs with a single recursive rule, IPL 32 (1989), 281–287.

    Article  MATH  MathSciNet  Google Scholar 

  3. S. Abiteboul, V. Vianu, DATALOG extensions for database queries and updates, INRIA report 900 (1988).

    Google Scholar 

  4. M. Ajtai, Y. Gurevich, Datalog versus first order logic, Proc. 30th IEEE FOCS, (1989), 142–148.

    Google Scholar 

  5. C. Beeri, P. Kanellakis, F. Bancilhon, R. Ramakrishnan, Bounds on the propagation of selection into logic programs, Proc. 6th. ACM-PODS, San Diego (1987), 214–226.

    Google Scholar 

  6. F. Bancilhon, R. Ramakrishnan, Performance evaluation of Data Intensive Logic Programs, in Foundations of Deductive DataBases and Logic Programming,. J. Minker Ed., Morgan-Kaufman, Los Altos (1988), 439–517.

    Google Scholar 

  7. S. Cosmadakis, H. Gaifman, P. Kanellakis, M. Vardi, Decidable optimizations for database logic programs, Proc. ACM-STOC, 1988.

    Google Scholar 

  8. H. Gaifman, H. Mairson, Y. Savig, and M. Vardi, Undecidable optimization problems for database logic programs, Proc of Logic in Comp. Sci. (1987).

    Google Scholar 

  9. F. Gire, Modèles par défaut des programmes effectivement déterministes, LITP Rep. 90-18 (1990).

    Google Scholar 

  10. I. Guessarian, Deciding boundedness for uniformly connected DATALOG programs, Proc. ICDT'90, Lect. Notes in Comput. Sci. 470 (1990), 395–405.

    MATH  Google Scholar 

  11. G. Hillebrand, P. Kanellakis, H. Mairson, and M. Vardi, Tools for DATALOG boundedness, Proc. 10th ACM-PODS (1991), 1–12.

    Google Scholar 

  12. Y.E. Ioannidis, A time bound on the materialization of some recursively defined views. In Proc. 11 th VLDB (1985), 219–226.

    Google Scholar 

  13. P. Kanellakis, Logic programming and parallel complexity, in Foundations of Deductive DataBases and Logic Programming, J. Minker Ed., Morgan-Kaufman, Los Altos (1987), 547–588.

    Google Scholar 

  14. P. Kanellakis, private communication.

    Google Scholar 

  15. P. Kanellakis and S. Abiteboul, Deciding bounded recursion in database logic programs, SIGACT News 20 (1989), 17–23.

    Article  Google Scholar 

  16. P. Kolaitis and C. Papadimitriou, Why not negation by fixpoint?, in Proc. 7th ACM-PODS (1988), 231–239.

    Google Scholar 

  17. D. Makinson, General theory of cumulative inference, unpublished manuscript.

    Google Scholar 

  18. J.F. Naughton and Y. Sagiv, A decidable class of bounded recursions. In Proc. 6 th ACM-PODS (1986), 227–236.

    Google Scholar 

  19. J. Naughton, Data independent recursion in deductive databases, Jour. Comput. Sys. Sci. 38 (1989), 259–289.

    Article  MATH  MathSciNet  Google Scholar 

  20. S. Naqvi and S. Tsur, A logical language for data and knowledge bases, Computer Science Press, New York (1989).

    Google Scholar 

  21. Y. Sagiv, On computing restricted projections of representative instances, Proc. 4th ACM-PODS, (1985), 171–180.

    Google Scholar 

  22. Y. Sagiv, M. Yannakakis, Equivalences among relational expressions with the union and difference operators, Jour. Assoc. Comput. Mac., 27 (1980), 633–655.

    MATH  MathSciNet  Google Scholar 

  23. K. Taghva, T. Wu, On the equivalence of a class of purely exponential logic queries to linear queries, to appear in RAIRO Inf. Théor.

    Google Scholar 

  24. B. Thalheim, Design tools for large relational database systems, Proc. MFDBS'87, Lect. Notes in Comput. Sci. 305 (1987), 2105–224.

    Google Scholar 

  25. J.D. Ullman, Data base and knowledge-base systems, 3rd ed. Computer Science Press, New York (1989).

    Google Scholar 

  26. A. Van Gelder, K. Ross, J. Schlipf, The well-founded semantics for general logic programs, Jour. Assoc. Comput. Mac., 38 (1991), 620–650.

    MATH  Google Scholar 

  27. M.Y. Vardi, Decidability and undecidability results for boundedness of linear recursive queries, in Proc. 7th ACM-PODS (1988).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. L.I.T.P. Université Paris 6, 4 Place Jussieu, 75252, Paris Cedex 05, France

    Irène Guessarian & Marcos Veloso-Peixoto

Authors
  1. Irène Guessarian
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marcos Veloso-Peixoto
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ivan M. Havel Václav Koubek

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Guessarian, I., Veloso-Peixoto, M. (1992). About boundedness for some datalog and DATALOGneg programs. In: Havel, I.M., Koubek, V. (eds) Mathematical Foundations of Computer Science 1992. MFCS 1992. Lecture Notes in Computer Science, vol 629. Springer, Berlin, Heidelberg . https://doi.org/10.1007/3-540-55808-X_27

Download citation

  • DOI: https://doi.org/10.1007/3-540-55808-X_27

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55808-8

  • Online ISBN: 978-3-540-47291-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation