A Closed Form for Datalog Queries with Integer Order.

@inproceedings{DBLP:conf/icdt/Revesz90,
  author    = {Peter Z. Revesz},
  editor    = {Serge Abiteboul and
               Paris C. Kanellakis},
  title     = {A Closed Form for Datalog Queries with Integer Order},
  booktitle = {ICDT'90, Third International Conference on Database Theory, Paris,
               France, December 12-14, 1990, Proceedings},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {470},
  year      = {1990},
  isbn      = {3-540-53507-1},
  pages     = {187-201},
  ee        = {http://dx.doi.org/10.1007/3-540-53507-1_77},
  crossref  = {DBLP:conf/icdt/90},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

ACM SIGMOD Anthology

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the CD and click on the path of your mount point:
  /Anthology/An2-2 or /cdrom

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the DVD and click on the path of your mount point:
  /Anthology/aDVD1 or /dvd

Journal Version

References

[AV88]

Serge Abiteboul, Victor Vianu: Procedural and Declarative Database Update Languages. PODS 1988: 240-250

[AGSS86]

...

[C87]

Alain Colmerauer: An Introduction to Prolog III. Commun. ACM 33(7): 69-90(1990)

[Ch88]

Ashok K. Chandra: Theory of Database Queries. PODS 1988: 1-9

[CH80]

Ashok K. Chandra, David Harel: Computable Queries for Relational Data Bases. J. Comput. Syst. Sci. 21(2): 156-178(1980)

[ChI89]

Jan Chomicki, Tomasz Imielinski: Relational Specifications of Infinite Query Answers. SIGMOD Conference 1989: 174-183

[D88]

Mehmet Dincbas, Pascal Van Hentenryck, Helmut Simonis, Abderrahmane Aggoun, Thomas Graf, Françoise Berthier: The Constraint Logic Programming Language CHIP. FGCS 1988: 693-702

[FG77]

Jeanne Ferrante, James R. Geiser: An Efficient Decision Procedure for the Theory of Rational Order. Theor. Comput. Sci. 4(2): 227-233(1977)

[FR79]

...

[HS89]

Richard Hull, Jianwen Su: Domain Independence and the Relational Calculus. Acta Inf. 31(6): 513-524(1994)

[JL87]

Joxan Jaffar, Jean-Louis Lassez: Constraint Logic Programming. POPL 1987: 111-119

[KSW90]

Froduald Kabanza, Jean-Marc Stévenne, Pierre Wolper: Handling Infinite Temporal Data. PODS 1990: 392-403

[Ka90]

Paris C. Kanellakis: Elements of Relational Database Theory. Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B) 1990: 1073-1156

[KKR90]

Paris C. Kanellakis, Gabriel M. Kuper, Peter Z. Revesz: Constraint Query Languages. PODS 1990: 299-313

[Ki88]

Michael Kifer: On Safety, Domain Independence, and Capturability of Database Queries (Preliminary Report). JCDKB 1988: 405-415

[Klee36]

...

[KP88]

Phokion G. Kolaitis, Christos H. Papadimitriou: Why Not Negation by Fixpoint? PODS 1988: 231-239

[LP81]

Harry R. Lewis, Christos H. Papadimitriou: Elements of the Theory of Computation. Prentice-Hall 1981, ISBN 0-13-273417-6

[L84]

John W. Lloyd: Foundations of Logic Programming, 1st Edition. Springer 1984, ISBN 3-540-13299-6

[R88]

Raghu Ramakrishnan: Magic Templates: A Spellbinding Approach to Logic Programs. ICLP/SLP 1988: 140-159

[Ull82]

Jeffrey D. Ullman: Principles of Database Systems, 2nd Edition. Computer Science Press 1982, ISBN 0-914894-36-6

[UvG88]

Jeffrey D. Ullman, Allen Van Gelder: Parallel Complexity of Logical Query Programs. Algorithmica 3: 5-42(1988)

[V82]

Moshe Y. Vardi: The Complexity of Relational Query Languages (Extended Abstract). STOC 1982: 137-146