Finite-Model Theory - a Personal Perspective.

Ronald Fagin: Finite-Model Theory - a Personal Perspective. ICDT 1990: 3-24
  author    = {Ronald Fagin},
  editor    = {Serge Abiteboul and
               Paris C. Kanellakis},
  title     = {Finite-Model Theory - a Personal Perspective},
  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     = {3-24},
  ee        = {db/conf/icdt/Fagin90.html},
  crossref  = {DBLP:conf/icdt/90},
  bibsource = {DBLP,}

ACM SIGMOD Anthology

CDROM Version: Load the CDROM "Volume 2 Issue 2, EDBT, ICDT, MFDBS, DASFAA" and ... DVD Version: Load ACM SIGMOD Anthology DVD 1" and ... BibTeX

Journal Version

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


Miklós Ajtai, Yuri Gurevich: Monotone versus positive. J. ACM 34(4): 1004-1015(1987) BibTeX
Miklós Ajtai, Yuri Gurevich: Datalog vs. First-Order Logic. FOCS 1989: 142-147 BibTeX
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
Ronald V. Book, Christopher B. Wilson, Xu Mei-Rui: Relativizing Time, Space, and Time-Space. SIAM J. Comput. 11(3): 571-581(1982) BibTeX
Jin-yi Cai, Martin Fürer, Neil Immerman: An Optimal Lower Bound on the Number of Variables for Graph Identification. FOCS 1989: 612-617 BibTeX
Ashok K. Chandra, David Harel: Structure and Complexity of Relational Queries. J. Comput. Syst. Sci. 25(1): 99-128(1982) BibTeX
Ashok K. Chandra: Theory of Database Queries. PODS 1988: 1-9 BibTeX
Stephen A. Cook: The Complexity of Theorem-Proving Procedures. STOC 1971: 151-158 BibTeX
Stephen A. Cook: A Hierarchy for Nondeterministic Time Complexity. STOC 1972: 187-192 BibTeX
Michael I. Dekhtyar: On the Relativization of Deterministic and Nondeterministic Complexity Classes. MFCS 1976: 255-259 BibTeX
Ronald Fagin: Horn clauses and database dependencies. J. ACM 29(4): 952-985(1982) BibTeX
Merrick L. Furst, James B. Saxe, Michael Sipser: Parity, Circuits, and the Polynomial-Time Hierarchy. FOCS 1981: 260-270 BibTeX
M. R. Garey, David S. Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman 1979, ISBN 0-7167-1044-7
M. R. Garey, David S. Johnson, Larry J. Stockmeyer: Some Simplified NP-Complete Graph Problems. Theor. Comput. Sci. 1(3): 237-267(1976) BibTeX
Haim Gaifman, Harry G. Mairson, Yehoshua Sagiv, Moshe Y. Vardi: Undecidable Optimization Problems for Database Logic Programs. LICS 1987: 106-115 BibTeX
Etienne Grandjean: Complexity of the First-Order Theory of Almost All Finite Structures. Information and Control 57(2/3): 180-204(1983) BibTeX
Juris Hartmanis, Neil Immerman, Vivian Sewelson: Sparse Sets in NP-P: EXPTIME versus NEXPTIME. Information and Control 65(2/3): 158-181(1985) BibTeX
Neil Immerman: Number of Quantifiers is Better Than Number of Tape Cells. J. Comput. Syst. Sci. 22(3): 384-406(1981) BibTeX
Neil Immerman: Upper and Lower Bounds for First Order Expressibility. J. Comput. Syst. Sci. 25(1): 76-98(1982) BibTeX
Neil Immerman: Relational Queries Computable in Polynomial Time. Information and Control 68(1-3): 86-104(1986) BibTeX
Neil Immerman: Languages that Capture Complexity Classes. SIAM J. Comput. 16(4): 760-778(1987) BibTeX
Neil Immerman: Nondeterministic Space is Closed Under Complementation. SIAM J. Comput. 17(5): 935-938(1988) BibTeX
Paris C. Kanellakis: Elements of Relational Database Theory. Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B) 1990: 1073-1156 BibTeX
Phokion G. Kolaitis: Implicit Definability on Finite Structures and Unambiguous Computations (Preliminary Report). LICS 1990: 168-180 BibTeX
Phokion G. Kolaitis, Moshe Y. Vardi: The Decision Problem for the Probabilities of Higher-Order Properties. STOC 1987: 425-435 BibTeX
Phokion G. Kolaitis, Moshe Y. Vardi: 0-1 Laws and Decision Problems for Fragments of Second-Order Logic. Inf. Comput. 87(1/2): 301-337(1990) BibTeX
Phokion G. Kolaitis, Moshe Y. Vardi: 0-1 Laws for Infinitary Logics (Preliminary Report). LICS 1990: 156-167 BibTeX
David Maier: The Theory of Relational Databases. Computer Science Press 1983, ISBN 0-914894-42-0
Contents BibTeX
Leszek Pacholski, Wieslaw Szwast: The 0-1 Law Fails for the Class of Existential Second Order Gödel Sentences with Equality. FOCS 1989: 160-163 BibTeX
Walter J. Savitch: Relationships Between Nondeterministic and Deterministic Tape Complexities. J. Comput. Syst. Sci. 4(2): 177-192(1970) BibTeX
Róbert Szelepcsényi: The Method of Forced Enumeration for Nondeterministic Automata. Acta Inf. 26(3): 279-284(1988) BibTeX
Jeffrey D. Ullman: Principles of Database and Knowledge-Base Systems, Volume I. Computer Science Press 1988, ISBN 0-7167-8158-1
Contents BibTeX
Jeffrey D. Ullman: Principles of Database and Knowledge-Base Systems, Volume II. Computer Science Press 1989, ISBN 0-7167-8162-X
Contents BibTeX
Moshe Y. Vardi: The Complexity of Relational Query Languages (Extended Abstract). STOC 1982: 137-146 BibTeX
Moshe Y. Vardi: On Decomposition of Relational Databases. FOCS 1982: 176-185 BibTeX

Referenced by

  1. Sérgio Lifschitz, Victor Vianu: A Probabilistic View of Datalog Parallelization. ICDT 1995: 294-307
  2. Serge Abiteboul, Kevin J. Compton, Victor Vianu: Queries Are Easier Than You Thought (Probably). PODS 1992: 23-32
  3. Serge Abiteboul, Moshe Y. Vardi, Victor Vianu: Computing with Infinitary Logic. ICDT 1992: 113-123
ACM SIGMOD Anthology - DBLP: [Home | Search: Author, Title | Conferences | Journals]
Lecture Notes in Computer Science: Copyright © by Springer
Digitization of EDBT/ICDT/MFDBS proceedings was supported by the EDBT Endowment.
ACM SIGMOD Anthology: Copyright © by ACM (, Corrections:
DBLP: Copyright © by Michael Ley (, last change: Sat May 16 23:19:01 2009