A closed form for datalog queries with integer order

  • Peter Z. Revesz
Constraint Logic Programming
Part of the Lecture Notes in Computer Science book series (LNCS, volume 470)


The use of constraints within logic programming and within database languages promises interesting new applications. We show that Datalog queries with simple integer order constraints can be evaluated bottom-up in closed form over generalized databases.


Logic Program Logic Programming Integer Order Rule Application Sequence Point 
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. [AV88]
    S. Abiteboul, V. Vianu. Procedural and Declarative Database Update Languages. Proc. 7th ACM Symposium on Principles of Database Systems, 240–250, 1988.Google Scholar
  2. [AGSS86]
    A.K. Aylamazyan, M.M. Gilula, A.P. Stolboushkin, G.F. Schwartz. Reduction of the Relational Model with Infinite Domain to the Case of Finite Domains. Proc. USSR Acad. of Science (Doklady), 286(2):308–311, 1986.Google Scholar
  3. [C87]
    A. Colmerauer. An Introduction to Prolog III. Draft, 1987.Google Scholar
  4. [Ch88]
    A.K. Chandra. Theory of Database Queries. 7th ACM Symposium on Principles of Database Systems, 1–9, 1988.Google Scholar
  5. [CH80]
    A.K. Chandra, D. Harel. Computable Queries for Relational Data Bases. Journal of Computer and Systems Sciences, 21:156–178, 1980.Google Scholar
  6. [ChI89]
    J. Chomicki, T. Imielinski. Relational Specifications of Infinite Query Answers. Proc. ACM SIGMOD International Conference on Management of Data, 174–183, 1989.Google Scholar
  7. [D88]
    M. Dincbas, et al. The Constraint Logic Programming Language CHIP. Proc. Fifth Generation Computer Systems, Tokyo Japan, 1988.Google Scholar
  8. [FG77]
    J. Ferrante, J.R. Geiser. An Efficient Decision Procedure for the Theory of Rational Order. Theoretical Computer Science, 4:227–233, 1977.Google Scholar
  9. [FR79]
    J. Ferrante, C.W. Rackoff. The Computational Complexity of Logical Theories, Springer-Verlag (No. 718), 1979.Google Scholar
  10. [HS89]
    R. Hull, J. Su. Domain Independence and the Relational Calculus. Technical Report 88-64, University of Southern California, submitted to IPL, 1989.Google Scholar
  11. [JL87]
    J. Jaffar, J-L. Lassez. Constraint Logic Programming. Proc. 14th ACM Symposium on Principles of Programming Languages, 111–119, 1987.Google Scholar
  12. [KSW90]
    F. Kabanza, J-M. Stevenne, P. Wolper. Handling Infinite Temporal Data, 9th ACM Symposium on Principles of Database Systems, 392–403, 1990.Google Scholar
  13. [Ka90]
    P.C. Kanellakis. Elements of Relational Database Theory. Handbook of Theoretical Computer Science, North-Holland, to appear.Google Scholar
  14. [KKR90]
    P.C. Kanellakis, G.M. Kuper, P.Z. Revesz. Constraint Query Languages, 9th ACM Symposium on Principles of Database Systems, 299–313, 1990.Google Scholar
  15. [Ki88]
    M. Kifer. On Safety, Domain Independence, and Capturability of Database Queries. Proc. International Conference on Databases and Knowledge Bases, Jerusalem Israel, 1988.Google Scholar
  16. [Klee36]
    S.C. Kleene. General Recursive Functions on Natural Numbers. Matematische Annalen, 112:727–742, 1936.Google Scholar
  17. [KP88]
    P. Kolaitis, C.H. Papadimitriou. Why not Negation by Fixpoint? Proc. 7th ACM Symposium on Principles of Database Systems, 231–239, 1988.Google Scholar
  18. [LP81]
    H.R. Lewis, C.H. Papadimitriou. Elements of the Theory of Computation. Prentice-Hall, 1981.Google Scholar
  19. [L84]
    J.W. Lloyd. Foundations of Logic Programming. Springer-Verlag, 1984.Google Scholar
  20. [R88]
    R. Ramakrishnan. Magic Templates: A Spellbinding Approach to Logic Programs. Proc. 5th International Conference on Logic Programming, 141–159, 1988.Google Scholar
  21. [Ull82]
    J.D. Ullman. Principles of Database Systems. Computer Science Press, 2nd Ed., 1982.Google Scholar
  22. [UvG88]
    J.D. Ullman, A. Van Gelder. Parallel Complexity of Logical Query Programs. Algorithmica, 3:5–42, 1988.Google Scholar
  23. [V82]
    M.Y. Vardi. The Complexity of Relational Query Languages. Proc. 14th ACM Symposium on Theory of Computing, 137–146, 1982.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • Peter Z. Revesz
    • 1
  1. 1.Department of Computer ScienceBrown UniversityProvidence

Personalised recommendations