Languages for Polynomial-Time Queries - An Ongoing Quest

[1]  Mihalis Yannakakis,et al.  On Datalog vs. Polynomial Time , 1995, J. Comput. Syst. Sci..

[2]  Martin Otto,et al.  Ptime canonization for two variables with counting , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.

[3]  Lauri Hella,et al.  How to define a linear order on finite models , 1994, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.

[4]  N. Immerman,et al.  An optimal lower bound on the number of variables for graph identification , 1992, Comb..

[5]  Lauri Hella,et al.  Logical hierarchies in PTIME , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.

[6]  Phokion G. Kolaitis,et al.  Generalized quantifiers and pebble games on finite structures , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.

[7]  Mihalis Yannakakis,et al.  On Datalog vs. polynomial time (extended abstract) , 1991, PODS '91.

[8]  Serge Abiteboul,et al.  Generic Computation and its complexity , 1991, STOC '91.

[9]  Ronald Fagin,et al.  Finite-Model Theory - A Personal Perspective , 1990, Theor. Comput. Sci..

[10]  Neil Immerman,et al.  Descriptive and Computational Complexity , 1989, FCT.

[11]  S. Abiteboul,et al.  Fixpoint extensions of first-order logic and datalog-like languages , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[12]  Neil Immerman,et al.  Relational Queries Computable in Polynomial Time , 1986, Inf. Control..

[13]  Saharon Shelah,et al.  Fixed-point extensions of first-order logic , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[14]  David Harel,et al.  Horn Clauses Queries and Generalizations , 1985, J. Log. Program..

[15]  Yuri Gurevich,et al.  Toward logic tailored for computational complexity , 1984 .

[16]  Moshe Y. Vardi.  The complexity of relational query languages (Extended Abstract) , 1982, STOC '82.

[17]  Neil Immerman,et al.  Upper and lower bounds for first order expressibility , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[18]  David Harel,et al.  Structure and complexity of relational queries , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[19]  David Harel,et al.  Computable Queries for Relational Data Bases , 1980, J. Comput. Syst. Sci..

[20]  Alfred V. Aho,et al.  Universality of data retrieval languages , 1979, POPL.

[21]  K. Jon Barwise,et al.  On Moschovakis closure ordinals , 1977, Journal of Symbolic Logic.

[22]  Ronald Fagin,et al.  Probabilities on finite models , 1976, Journal of Symbolic Logic.

[23]  Stephen A. Cook,et al.  An observation on time-storage trade off , 1973, J. Comput. Syst. Sci..

[24]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[25]  Robert A. Di Paola.  The Recursive Unsolvability of the Decision Problem for the Class of Definite Formulas , 1969, JACM.

[26]  Perlindström.  First Order Predicate Logic with Generalized Quantifiers , 1966 .

[27]  Anuj Dawary,et al.  Innnitary Logic and Inductive Deenability over Finite Structures , 1995 .

[28]  A. Dawar.  Feasible computation through model theory , 1993 .

[29]  Phokion G. Kolaitis.  In nitary Logi s and 0-1 Laws , 1992 .

[30]  E. Lander,et al.  Describing Graphs: A First-Order Approach to Graph Canonization , 1990 .

[31]  C. Cavafy,et al.  The Greek poems of C.P. Cavafy , 1989 .

[32]  Christos H. Papadimitriou,et al.  A note the expressive power of Prolog , 1985, Bull. EATCS.

[33]  Ronald Fagin,et al.  Monadic generalized spectra , 1975, Math. Log. Q..

[34]  ’ Ronald Fagin,et al.  - Order Spectra and Polynomial-Time Recognizable Sets , 1974 .

[35]  E. F. Codd,et al.  Relational Completeness of Data Base Sublanguages , 1972, Research Report / RJ / IBM / San Jose, California.

[36]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[37]  E. F. Codd,et al.  A Relational Model for Large Shared Data Banks , 1970 .