David Harel  Home/Search
Context Related
| wisdom.weizmann.ac.il/pub/...9408.ps.Z 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: fermivista.math....weizmann.ac.il (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In computer science, one is interested mainly in finite objects. Insofar as infinite objects are of interest, they must be computable, i.e., recursive, thus admitting an effective finite representation. This leads to the notion of a recursive graph, or, more generally, a recursive structure, model or data base. In this paper we summarize our recent work on recursive structures and data bases, including (i) the high undecidability of many problems on recursive graphs and structures, (ii) a... (Update)
Context of citations to this paper: More
.... Related Work: One motivation of our approach was the study of automatic structures [48, 14] which are a subclass of recursive structures [43], and were introduced as a generalization of automatic groups [30] In an automatic structure M = h i, every predicate in is de nable...
...and thus cannot be used as input for an algorithm. In this context we want to mention a line of research that considers recursive structures [16], i.e. structures where every relation is computable by an algorithm that decides whether or not an input tuple belongs to the...
Cited by: More
Fixed-Point Query Languages for Linear Constraint Databases - Kreutzer (2000) (Correct)
Finite Presentations of Infinite Structures: Automata and.. - Blumensath, Grädel (2004) (Correct)
Definable Relations and First-Order Query Languages.. - Benedikt, Libkin.. (Correct)
Similar documents (at the sentence level):
53.4%: Towards a Theory of Recursive Structures - Harel (1998) (Correct)
Active bibliography (related documents): More All
1.6: More about Recursive Structures: Descriptive Complexity and.. - Hirst, Harel (1996) (Correct)
0.5: Linear Constraint Databases (Extended Abstract) - Grumbach, al. (Correct)
0.4: Metafinite Model Theory - Grädel, Gurevich (1997) (Correct)
Similar documents based on text: More All
1.0: Hamiltonian Paths in Infinite Graphs - Harel (1991) (Correct)
0.9: Completeness Results for Recursive Data Bases - Hirst, Harel (1996) (Correct)
0.1: Smart Play-Out of Behavioral Requirements - Harel, Kugler, Marelly, Pnueli (2002) (Correct)
Related documents from co-citation: More All
11: Automatic Structures - Blumensath - 1999
11: Constraint Databases (context) - Kuper, Libkin et al. - 2000
10: Finite model theory (context) - Ebbinghaus, Flum - 1995
BibTeX entry: (Update)
D. Harel. Towards a theory of recursive structures. In Proc. 23rd Int. Symp. on Mathematical Foundations of Computer Science, volume 1450 of LNCS, pages 36--53. Springer, 1998. http://citeseer.ist.psu.edu/article/harel98towards.html More
@article{ harel98towards,
author = "David Harel",
title = "Towards a Theory of Recursive Structures",
journal = "Lecture Notes in Computer Science",
volume = "1450",
pages = "36--??",
year = "1998",
url = "citeseer.ist.psu.edu/article/harel98towards.html" }
Citations (may not include all citations):379 The Complexity of Relational Query Languages (context) - Vardi - 1982
245 Relational Queries Computable in Polynomial Time - Immerman - 1986
229 Theory of Recursive Functions and Effective Computability (context) - Rogers - 1967
210 Generalized First-Order Spectra and Polynomial-Time Recogniz.. (context) - Fagin - 1974
198 Structure and Complexity of Relational Queries - Chandra, Harel - 1982
189 Computable Queries for Relational Data Bases - Chandra, Harel - 1980
120 Elementary Induction on Abstract Structures (context) - Moschovakis - 1974
114 Generic Computation and Its Complexity (context) - Abiteboul, Vianu - 1991
81 Probabilities on Finite Models (context) - Fagin - 1976
49 Range and Degree of Realizability of Formulas in the Restric.. (context) - Glebskii, Kogan et al. - 1969
47 Optimization, Approximation, and Complexity Classes (context) - Papadimitriou, Yannakakis - 1991
32 Logical definability of NP optimization problems - Kolaitis, Thakur - 1991
25 Quantifiers and Approximation (context) - Panconesi, Ranjan - 1993
25 the Complexity of Finding the Chromatic Number of a Recursiv.. - Beigel, Gasarch - 1989
16 Universal Graphs and Universal Functions (context) - Rado - 1964
13 Completeness Results for Recursive Data Bases - Hirst, Harel - 1993
9 Some Undecidable Problems Involving the Edge-Coloring and Ve.. (context) - Burr - 1984
7 Effective Coloration (context) - Bean - 1976
5 Taking it to the Limit: On Infinite Variants of NPComplete P.. (context) - Hirst, Harel - 1993
5 Hamiltonian Paths in Infinite Graphs - Harel - 1991
4 Recursive Euler and Hamiltonian Paths (context) - Bean - 1976
3 More about Recursive Structures: Zero-One Laws and Expressib.. (context) - Hirst, Harel
2 the Strength of Konig's Duality Theorem (context) - Aharoni, Magidor et al. - 1992
2 Functional Trees and Automorphisms of Models (context) - Morozov - 1993
1 Effective Matchmaking (Recursion Theoretic Aspects of a Theo.. (context) - Manaster, Rosenstein - 1972
1 A Survey of Lattices of R. E. Substructures (context) - Nerode, Remmel - 1985
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.wisdom.weizmann.ac.il.html): More
Local Majority Voting, Small Coalitions and Controlling Monopolies .. - Peleg (1996) (Correct)
On Constructing 1-1 One-Way Functions - Goldreich, Levin, Nisan (1995) (Correct)
Infinite Cyclic Impartial Games - Fraenkel, Rahat (2001) (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