Serge Abiteboul, Moshe Y. Vardi, Victor Vianu  Home/Search
Context Related
| inria.fr/INRIA/Pro...soReport042.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cosmos.inria.fr...=byyear&query=0 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We establish a general connection between fixpoint logic and complexity. On one side, we have fixpoint logic, parameterized by the choices of 1st-order operators (inflationary or noninflationary) and iteration constructs (deterministic, nondeterministic, or alternating). On the other side, we have the complexity classes between P and EXPTIME. Our parameterized fixpoint logics capture the complexity classes P, NP, PSPACE, and EXPTIME, but equality is achieved only over ordered structures. There ... (Update)
Context of citations to this paper: More
.... Finally, for future reference, we recall (a version of) Abiteboul Vianu s Relational machines [Abiteboul and Vianu 1991; Abiteboul Vardi Vianu 1997]. A relational machine is a Turing machine augmented with a relational store which is a structure of a fixed purely...
Cited by: More
Choiceless Polynomial Time - Andreas Blass Yuri (1997) (Correct)
Similar documents (at the sentence level): More
73.9%: Fixpoint Logics, Relational Machines, and Computational.. - Abiteboul, Vardi, Vianu (1997) (Correct)
25.4%: Computational Model Theory: An Overview - Vardi (1998) (Correct)
20.4%: Logic Journal - Of The Editor-In-Chief (Correct)
Active bibliography (related documents): More All
0.5: Computing With First-Order Logic - Abiteboul, Vianu (1995) (Correct)
0.5: Higher Order Logic - Leivant (1994) (Correct)
0.4: Finite-Model Theory - A Personal Perspective - Fagin (1993) (Correct)
Similar documents based on text: More All
0.3: Infinitary Logic and Inductive Definability over Finite.. - Dawar, Lindell (1995) (Correct)
0.2: Computing with Infinitary Logic - Abiteboul, Vardi (1995) (Correct)
0.2: First Order Logic, Fixed Point Logic and Linear Order - Dawar, Lindell, al. (1995) (Correct)
Related documents from co-citation: More All
2: Infinitary Logic and 0--1 Laws (context) - Vardi, Kolaitis et al. - 1992
2: Elementary induction on abstract structures (context) - Moschovakis - 1974
2: Communicating evolving algebras - Glavan, Rosenzweig - 1993
BibTeX entry: (Update)
Abiteboul, Vardi and Vianu 1997 Serge Abiteboul, Moshe Y. Vardi and Victor Vianu, "Fixpoint Logics, Relational Machines, and Computational Complexity ", Journal of ACM, to appear. http://citeseer.ist.psu.edu/abiteboul93fixpoint.html More
@misc{ vardi97fixpoint,
author = "A. Vardi and V. Abiteboul and M. Vardi and V. Vianu",
title = "Fixpoint Logics, Relational Machines, and Computational Complexity",
text = "Abiteboul, Vardi and Vianu 1997 Serge Abiteboul, Moshe Y. Vardi and Victor
Vianu, Fixpoint Logics, Relational Machines, and Computational Complexity
, Journal of ACM, to appear.",
year = "1997",
url = "citeseer.ist.psu.edu/abiteboul93fixpoint.html" }
Citations (may not include all citations):4212 Computers and Intractability - A Guide to the Theory of NP-C.. (context) - Garey, Johnson - 1979
379 The complexity of relational query languages (context) - Vardi - 1982
250 Computer Science Press (context) - Ullman, Knowledge-Base et al. - 1989
245 Relational queries computable in polynomial time - Immerman - 1986
211 Languages that capture complexity classes - Immerman - 1987
210 Generalized first--order spectra and polynomial--time recogn.. (context) - Fagin - 1974
198 Structure and complexity of relational queries - Chandra, Harel - 1982
189 Computable queries for relational databases - Chandra, Harel - 1980
163 Universality of data retrieval languages (context) - Aho, Ullman - 1979
149 Logic and the challenge of computer science (context) - Gurevich - 1988
129 Theoretical Computer Science (context) - Stockmeyer, hierarchy - 1977
124 Journal of the ACM (context) - Chandra, Kozen et al. - 1981
120 Elementary Induction on Abstract Structures (context) - Moschovakis - 1974
114 Generic computation and its complexity (context) - Abiteboul, Vianu - 1991
108 Relational completeness of data base sublanguages (context) - Codd - 1972
103 Bounded Arithmetics (context) - Buss - 1986
95 Fixed-point extensions of first-order logic (context) - Gurevich, Shelah - 1986
66 Describing graphs: a first-order approach to graph canonizat.. - Immerman, Lander - 1990
63 Toward logic tailored for computational complexity - Gurevich - 1984
61 Descriptive and computational complexity - Immerman - 1989
57 Infinitary logic and inductive definability over finite stru.. - Dawar, Lindell et al. - 1991
45 Fixpoint extensions of first-order logic and Dataloglike lan.. (context) - Abiteboul, Vianu - 1989
43 Zeitschrift fur Mathematische Logik und Grundlagen der Mathe.. (context) - Fagin, spectra - 1975
42 Non-deterministic languages to express deterministic transfo.. (context) - Abiteboul, Vianu - 1990
39 Algebras of feasible functions (context) - Gurevich - 1983
39 Expressibility as a complexity measure: results and directio.. (context) - Immerman - 1987
39 Bounded linear logic: a modular approach to polynomial time .. (context) - Girard, Scedrov et al. - 1990
29 Descriptive characterization of computational complexity (context) - Leivant - 1989
20 Complexity classes and theories of finite models (context) - Lynch - 1982
19 Polynomial computability and recursivity in finite domains (context) - Yu - 1980
17 Turing machines and the spectra of first-order formulas (context) - Jones, Selman - 1974
15 An analysis of fixed point queries on binary trees (context) - Lindell - 1991
14 A foundational delineation of computational feasibility (context) - Leivant - 1991
14 Inductive definitions over finite structures (context) - Leivant - 1990
12 laws for infinitary logics (context) - Kolaitis, Vardi - 1990
12 Some relationships between logic of programs and complexity .. (context) - Tiuryn, Urzyczyn - 1988
11 Universal quantifiers and time complexity of random access m.. (context) - Grandjean - 1985
10 The spectra of first-order sentences and computational compl.. (context) - Grandjean - 1984
10 Computing with infinitary logic - Abiteboul, Vardi et al. - 1992
8 Stable networks and product graphs (context) - Feder - 1981
8 Monotonic use of space and computational complexity over abs.. (context) - Leivant - 1989
7 Relational between nondeterministic and deterministic tape c.. (context) - Savitch - 1980
6 The relational model for systems of automatic testing (context) - Livchak - 1982
6 Axiomatic recursive function theory (context) - Friedman - 1971
5 Automatic Documentation and Mathematical Linguistics (context) - Livchak, model et al. - 1983
5 Information and Control (context) - Harel, Peleg et al. - 1984
4 An algebra and a logic for NC (context) - Compton - 1988
4 A logical approach to the problem of P=NP (context) - Yu - 1980
3 Characterizing complexity classesby higher-type primitive-re.. (context) - Goerdt - 1989
2 Uniform definability on finite structures with successor (context) - de Rougemont - 1984
Documents on the same site (http://cosmos.inria.fr:8080/cgi-bin/publisverso?what=byyear&query=0): More
Design and Implementation of Object-Oriented Views - Santos (1995) (Correct)
Valmont: a Language for Workflow Programming - Chan, Leung (1998) (Correct)
Relational Transducers for Electronic Commerce - Abiteboul, Vianu, Fordham, Yesha (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC