Computing With First-Order Logic (1995)

Cached

Download Links

by Serge Abiteboul , Victor Vianu
Citations:53 - 13 self

Documents Related by Co-Citation

269 Relational Queries Computable in Polynomial Time – Neil Immerman - 1986
530 The complexity of relational query languages – M Y Vardi - 1982
119 Generic computation and its complexity – Serge Abiteboul, Victor Vianu
152 Datalog extensions for database queries and updates – S Abiteboul, V Vianu - 1991
86 On Monadic NP vs. Monadic co-NP – R Fagin, L J Stockmeyer, M Y Vardi - 1995
33 Local Properties of Query Languages – Guozhu Dong, Leonid Libkin, Limsoon Wong
1526 V.: Foundations of Databases – S Abiteboul, R Hull, Vianu - 1995
503 Finite Model Theory – H-D Ebbinghaus, J Flum - 1995
56 Infinitary Logic and Inductive Definability over Finite Structures – Anuj Dawar, Steven Lindell, Scott Weinstein - 1995
129 On local and non-local properties – H GAIFMAN - 1982
48 Logical hierarchies in PTIME – L Hella - 1992
75 Toward Logic Tailored for Computational Complexity – Yuri Gurevich - 1984
243 Structure and Complexity of Relational Queries – Ashok Chandra, David Harel - 1982
27 Descriptive characterizations of computational complexity – Daniel Leivant - 1989
80 Fixed-point extensions of first-order logic – Y Gurevich, S Shelah - 1985
68 Model-theoretic methods in the study of elementary logic – W Hanf - 1965
43 Infinitary Logics and 0-1 Laws – Phokion G. Kolaitis, Moshe Y. Vardi - 1992
33 A.K.: Programming primitives for database languages – ACM Symp on Chandra - 1981
64 On Moschovakis Closure Ordinals – J Barwise - 1977