A Paradox in Database Theory.

@inproceedings{DBLP:conf/icdt/Grumbach92,
  author    = {St{\'e}phane Grumbach},
  editor    = {Joachim Biskup and
               Richard Hull},
  title     = {A Paradox in Database Theory},
  booktitle = {Database Theory - ICDT'92, 4th International Conference, Berlin,
               Germany, October 14-16, 1992, Proceedings},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {646},
  year      = {1992},
  isbn      = {3-540-56039-4},
  pages     = {312-325},
  ee        = {db/conf/icdt/Grumbach92.html},
  crossref  = {DBLP:conf/icdt/92},
  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

References

[1]

Serge Abiteboul, Kevin J. Compton, Victor Vianu: Queries Are Easier Than You Thought (Probably). PODS 1992: 23-32 BibTeX

[2]

Serge Abiteboul, Victor Vianu: Datalog Extensions for Database Queries and Updates. J. Comput. Syst. Sci. 43(1): 62-124(1991) BibTeX

[3]

...

[4]

Foto N. Afrati, Stavros S. Cosmadakis, Mihalis Yannakakis: On Datalog vs. Polynomial Time. PODS 1991: 13-25 BibTeX

[5]

Andreas Blass, Yuri Gurevich, Dexter Kozen: A Zero-One Law for Logic with a Fixed-Point Operator. Information and Control 67(1-3): 70-90(1985) BibTeX

[6]

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

[7]

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

[8]

Ashok K. Chandra, David Harel: Structure and Complexity of Relational Queries. J. Comput. Syst. Sci. 25(1): 99-128(1982) BibTeX

[9]

Ashok K. Chandra, Moshe Y. Vardi: The Implication Problem for Functional and Inclusion Dependencies is Undecidable. SIAM J. Comput. 14(3): 671-677(1985) BibTeX

[10]

Stavros S. Cosmadakis, Haim Gaifman, Paris C. Kanellakis, Moshe Y. Vardi: Decidable Optimization Problems for Database Logic Programs (Preliminary Report). STOC 1988: 477-490 BibTeX

[11]

Pratul Dublish, S. N. Maheshwari: Expressibility of Bounded-Arity Fixed-Point Query Hierarchies. PODS 1989: 324-335 BibTeX

[12]

...

[13]

Ronald Fagin: Finite-Model Theory - A Personal Perspective. Theor. Comput. Sci. 116(1&2): 3-31(1993) BibTeX

[14]

...

[15]

Haim Gaifman, Harry G. Mairson, Yehoshua Sagiv, Moshe Y. Vardi: Undecidable Optimization Problems for Database Logic Programs. LICS 1987: 106-115 BibTeX

[16]

...

[17]

Etienne Grandjean: Complexity of the First-Order Theory of Almost All Finite Structures. Information and Control 57(2/3): 180-204(1983) BibTeX

[18]

Phokion G. Kolaitis, Moshe Y. Vardi: The Decision Problem for the Probabilities of Higher-Order Properties. STOC 1987: 425-435 BibTeX

[19]

Phokion G. Kolaitis, Moshe Y. Vardi: 0-1 Laws and Decision Problems for Fragments of Second-Order Logic. LICS 1988: 2-11 BibTeX

[20]

Phokion G. Kolaitis, Moshe Y. Vardi: 0-1 Laws for Infinitary Logics (Preliminary Report). LICS 1990: 156-167 BibTeX

[21]

Phokion G. Kolaitis, Moshe Y. Vardi: On the Expressive Power of Datalog: Tools and a Case Study. PODS 1990: 61-71 BibTeX

[22]

V. S. Lakshmanan, Alberto O. Mendelzon: Inductive Pebble Games and the Expressive Power of Datalog. PODS 1989: 301-310 BibTeX

[23]

James F. Lynch: Probabilities of Sentences about Very Sparse Random Graphs. FOCS 1990: 689-696 BibTeX

[24]

...

[25]

Oded Shmueli: Decidability and Expressiveness of Logic Queries. PODS 1987: 237-249 BibTeX