Deciding boundedness for uniformly connected Datalog programs

  • Irène Guessarian
Logic And Databases
Part of the Lecture Notes in Computer Science book series (LNCS, volume 470)


We prove that boundedness is decidable for uniformly (and more generally strongly) connected Datalog programs. As for chain programs, which are a special case of uniformly connected programs, the proof is done by reducing the boundedness problem to context-free language finiteness. The same reduction technique could be used for containment problems.


Distinguished Variable Horn Clause Conjunctive Query Recursive Rule Connection Graph 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Ab89]
    S. Abiteboul, Boundedness is undecidable for Datalog programs with a single recursive rule, IPL 32 (1989), 281–287.Google Scholar
  2. [AG89]
    M. Ajtai, Y. Gurevich, Datalog versus first order logic, Proc. 30th IEEE FOCS, (1989), 142–148.Google Scholar
  3. [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
  4. [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
  5. [CGKV88]
    S. Cosmadakis, H. Gaifman, P. Kanellakis, M. Vardi, Decidable optimizations for database logic programs, Proc. ACM-STOC, 1988.Google Scholar
  6. [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
  7. [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
  8. [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
  9. [K89]
    P. Kanellakis, private communication.Google Scholar
  10. [KAb89]
    P. Kanellakis and S. Abiteboul, Deciding bounded recursion in database logic programs, SIGACT News 20 (1989), 17–23.Google Scholar
  11. [NS86]
    J.F. Naughton and Y. Sagiv, A decidable class of bounded recursions. In Proc. 6th ACM-PODS (1986), 227–236.Google Scholar
  12. [Na89]
    J. Naughton, Data independent recursion in deductive databases, Jour. Comput. Sys. Sci. 38 (1989), 259–289.Google Scholar
  13. [Sa85]
    Y. Sagiv, On computing restricted projections of representative instances, Proc. 4th ACM-PODS, (1985), 171–180.Google Scholar
  14. [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
  15. [Ul89]
    J.D. Ullman, Data base and knowledge-base systems, 3rd ed. Computer Science Press, New York (1989).Google Scholar
  16. [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 1990

Authors and Affiliations

  • Irène Guessarian
    • 1
  1. 1.C.N.R.S. - L.I.T.P. - Université Paris 6Paris Cedex 05France

Personalised recommendations