Serge Abiteboul, Victor Vianu  Home/Search
Context
Related
| inria.fr/INRIA/Pro...soReport059.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: this paper various devices operating directly on structures, without encoding. The motivation and benefits for doing this are manyfold. On a fundamental level, encodings of structures seem to be a technical device rather than an intrinsic feature. This point has already been made by several mathematicians such as Tarski [Tar86], and Harvey Friedman [Fri71] (see Section 5). It has come up more recently in the context of databases, where devices computing on structures model more acurately... (Update)
Similar documents (at the sentence level): More
17.6%: Fixpoint Logics, Relational Machines, and Computational.. - Abiteboul, Vardi, Vianu (1997) (Correct)
11.6%: Computing With First-Order Logic - Abiteboul, Vianu (1995) (Correct)
11.6%: Computing with Infinitary Logic - Abiteboul, Vardi (1995) (Correct)
Active bibliography (related documents): More All
0.8: Databases and Finite-Model Theory - Vianu (1997) (Correct)
0.6: The Power of Reflective Relational Machines - Abiteboul, Papadimitriou, Vianu (1994) (Correct)
0.5: Toward a General Theory of Computation and Specification over.. - Tucker, al. (1990) (Correct)
Similar documents based on text: More All
0.4: Infinitary Logic and Inductive Definability over Finite.. - Dawar, Lindell (1995) (Correct)
0.3: Relational Transducers for Electronic Commerce - Abiteboul, Vianu, Fordham, Yesha (1998) (Correct)
0.3: Active Views for Electronic Commerce - Abiteboul, Cluet, Milo, Vianu (1998) (Correct)
BibTeX entry: (Update)
@inproceedings{ abiteboul93computing,
author = "Serge Abiteboul and Victor Vianu",
title = "Computing on Structures",
booktitle = "Automata, Languages and Programming",
pages = "606-620",
year = "1993",
url = "citeseer.ist.psu.edu/384681.html" }
Citations (may not include all citations):379 The complexity of relational query languages (context) - Vardi - 1982
280 Object identity as a query language primitive (context) - Abiteboul, Kanellakis - 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 data bases - Chandra, Harel - 1980
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
124 Datalog extensions for database queries and updates (context) - Abiteboul, Vianu - 1991
120 Elementary Induction on Abstract Structures (context) - Moschovakis - 1974
114 Generic computation and its complexity (context) - Abiteboul, Vianu - 1991
103 Bounded Arithmetics (context) - Buss - 1986
95 Fixed-point extensions of first-order logic (context) - Gurevich, Shelah - 1986
88 Elements of relational database theory (context) - Kanellakis - 1991
78 On Moschovakis closure ordinals (context) - Barwise - 1977
76 Principles of Database and Knowledge Base Systems: Volume I .. (context) - Ullman - 1988
66 Describing graphs: a first-order approach to graph canonizat.. - Immerman, Lander - 1990
63 Toward logic tailored for computational complexity - Gurevich - 1984
63 Admissible Sets and Structures (context) - Barwise - 1975
61 Descriptive and computational complexity - Immerman - 1989
57 Infinitary logic and inductive definability over finite stru.. - Dawar, Lindell et al. - 1991
49 Model-Theoretic Logics (context) - Barwise, Feferman - 1985
46 Finite-Model Theory---a Personal Perspective - Fagin - 1990
45 Fixpoint extensions of first-order logic and Dataloglike lan.. (context) - Abiteboul, Vianu - 1989
44 Procedural languages for database queries and updates (context) - Abiteboul, Vianu - 1990
43 Computing with first-order logic - Abiteboul, Vianu
43 Zeitschrift fur Mathematische Logik und Grundlagen der Mathe.. (context) - Fagin, spectra - 1975
42 infinitary logic in finite-model theory (context) - Kolaitis, Vardi - 1992
39 Bounded linear logic: a modular approach to polynomial time .. (context) - Girard, Scedrov et al. - 1990
39 Algebras of feasible functions (context) - Gurevich - 1983
39 Expressibility as a complexity measure: results and directio.. (context) - Immerman - 1987
36 and computational complexity (context) - Abiteboul, Vardi et al. - 1992
32 Programming primitives for database languages (context) - Chandra - 1981
29 Descriptive characterization of computational complexity (context) - Leivant - 1989
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 Inductive definitions over finite structures (context) - Leivant - 1990
14 A foundational delineation of computational feasibility (context) - Leivant - 1991
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
9 Formalized computer programs (context) - Luckham, Park et al. - 1970
8 Stable networks and product graphs (context) - Feder - 1981
8 Monotonic use of space and computational complexity over abs.. (context) - Leivant - 1989
6 The Power of Methods with Parallel Semantics (context) - Denninghoff, Vianu - 1991
6 and elementary recursion theory (context) - Friedman, generalized - 1971
5 History and Philosophy of Logic (context) - Tarski, logical - 1986
4 on Principles of Database Systems (context) - Afrati, Cosmadakis et al. - 1991
4 An algebra and a logic for NC (context) - Compton - 1988
4 On nondeterminacy in simple computing devices (context) - Hartmanis - 1972
3 Characterizing complexity classesby higher-type primitive-re.. (context) - Goerdt - 1989
2 and elementary recursion theory (context) - Shepherdson, generalized - 1985
2 Upper and lower bounds for first-order expresibility (context) - Immerman - 1982
2 Uniform definability on finite structures with successor (context) - de Rougemont - 1984
1 The undecidability of the equivalence problem for program sc.. (context) - Luckham, Park - 1989
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