Advertisement

About boundedness for some datalog and DATALOGneg programs

  • Irène Guessarian
  • Marcos Veloso-Peixoto
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 629)

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.

Keywords

Logic Program Transitive Closure Horn Clause Conjunctive Query Recursive Program 
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. [ABW88]
    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. [Ab89]
    S. Abiteboul, Boundedness is undecidable for Datalog programs with a single recursive rule, IPL 32 (1989), 281–287.zbMATHMathSciNetCrossRefGoogle Scholar
  3. [AV88]
    S. Abiteboul, V. Vianu, DATALOG extensions for database queries and updates, INRIA report 900 (1988).Google Scholar
  4. [AG89]
    M. Ajtai, Y. Gurevich, Datalog versus first order logic, Proc. 30th IEEE FOCS, (1989), 142–148.Google Scholar
  5. [BKBR87]
    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. [BR88]
    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. [CGKV88]
    S. Cosmadakis, H. Gaifman, P. Kanellakis, M. Vardi, Decidable optimizations for database logic programs, Proc. ACM-STOC, 1988.Google Scholar
  8. [GMSV87]
    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. [Gi90]
    F. Gire, Modèles par défaut des programmes effectivement déterministes, LITP Rep. 90-18 (1990).Google Scholar
  10. [Gu90]
    I. Guessarian, Deciding boundedness for uniformly connected DATALOG programs, Proc. ICDT'90, Lect. Notes in Comput. Sci. 470 (1990), 395–405.zbMATHGoogle Scholar
  11. [HKMV91]
    G. Hillebrand, P. Kanellakis, H. Mairson, and M. Vardi, Tools for DATALOG boundedness, Proc. 10th ACM-PODS (1991), 1–12.Google Scholar
  12. [Io85]
    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. [K88]
    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. [K89]
    P. Kanellakis, private communication.Google Scholar
  15. [KAb89]
    P. Kanellakis and S. Abiteboul, Deciding bounded recursion in database logic programs, SIGACT News 20 (1989), 17–23.CrossRefGoogle Scholar
  16. [KP88]
    P. Kolaitis and C. Papadimitriou, Why not negation by fixpoint?, in Proc. 7th ACM-PODS (1988), 231–239.Google Scholar
  17. [Ma90]
    D. Makinson, General theory of cumulative inference, unpublished manuscript.Google Scholar
  18. [NS86]
    J.F. Naughton and Y. Sagiv, A decidable class of bounded recursions. In Proc. 6 th ACM-PODS (1986), 227–236.Google Scholar
  19. [Na89]
    J. Naughton, Data independent recursion in deductive databases, Jour. Comput. Sys. Sci. 38 (1989), 259–289.zbMATHMathSciNetCrossRefGoogle Scholar
  20. [NT89]
    S. Naqvi and S. Tsur, A logical language for data and knowledge bases, Computer Science Press, New York (1989).Google Scholar
  21. [Sa85]
    Y. Sagiv, On computing restricted projections of representative instances, Proc. 4th ACM-PODS, (1985), 171–180.Google Scholar
  22. [SY80]
    Y. Sagiv, M. Yannakakis, Equivalences among relational expressions with the union and difference operators, Jour. Assoc. Comput. Mac., 27 (1980), 633–655.zbMATHMathSciNetGoogle Scholar
  23. [TW89]
    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. [Th87]
    B. Thalheim, Design tools for large relational database systems, Proc. MFDBS'87, Lect. Notes in Comput. Sci. 305 (1987), 2105–224.Google Scholar
  25. [Ul89]
    J.D. Ullman, Data base and knowledge-base systems, 3rd ed. Computer Science Press, New York (1989).Google Scholar
  26. [VGRS91]
    A. Van Gelder, K. Ross, J. Schlipf, The well-founded semantics for general logic programs, Jour. Assoc. Comput. Mac., 38 (1991), 620–650.zbMATHGoogle Scholar
  27. [Va88]
    M.Y. Vardi, Decidability and undecidability results for boundedness of linear recursive queries, in Proc. 7th ACM-PODS (1988).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Irène Guessarian
    • 1
  • Marcos Veloso-Peixoto
    • 1
  1. 1.L.I.T.P. Université Paris 6Paris Cedex 05France

Personalised recommendations