Fixpoint Logics, Relational Machines, and Computational Complexity (1993)

Cached

Download Links

by Serge Abiteboul , Moshe Y. Vardi , Victor Vianu
Venue:In Structure and Complexity
Citations:37 - 5 self

Documents Related by Co-Citation

117 Generic computation and its complexity – S Abiteboul, V Vianu - 1991
268 Relational Queries Computable in Polynomial Time – Neil Immerman - 1986
527 The complexity of relational query languages – M Vardi - 1982
243 Structure and Complexity of Relational Queries – Ashok Chandra, David Harel - 1982
152 Datalog extensions for database queries and updates – S Abiteboul, V Vianu - 1991
80 Fixed-point extensions of first-order logic – Y Gurevich, S Shelah - 1986
56 Infinitary Logic and Inductive Definability over Finite Structures – Anuj Dawar, Steven Lindell, Scott Weinstein - 1995
64 On Moschovakis Closure Ordinals – J Barwise - 1977
229 Languages That Capture Complexity Classes – Neil Immerman - 1987
153 Logic and the Challenge of Computer Science – Yuri Gurevich - 1988
134 An Optimal Lower Bound on the Number of Variables for Graph Identification – Jin-yi Cai, Neil Immerman, Martin F├╝rer - 1992
83 Computable Queries for Relational Databases – Ashok Chandra, Asok K. Cadm, David Harel - 1980
3824 Introduction to Automata Theory, Languages, and Computation – J E Hopcroft, J D Ullman - 1979
496 Finite Model Theory – H-D Ebbinghaus, J Flum - 1995
52 Computing With First-Order Logic – Serge Abiteboul, Victor Vianu - 1995
169 Elementary Induction on Abstract Structures – Y Moschovakis - 1974
75 Toward Logic Tailored for Computational Complexity – Yuri Gurevich - 1984
269 Generalized first-order spectra and polynomial-time recognizable sets – R Fagin - 1974
27 Descriptive characterizations of computational complexity – Daniel Leivant - 1989