D. Harel. Towards a theory of recursive structures. In Proceedings of 23rd International Symposium on Mathematical Foundations of Computer Science MFCS 98, volume 1450 of Lecture Notes in Computer Science, pages 36-53. Springer, 1998.  Home/Search   Document Details and Download   Summary   Related Articles   Check

.... RC(S reg;left ) We find that each of these languages satisfies all three of the required criteria, while considerably extending the expressive power of RC(S) 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 Sigma i, every predicate in Omega is definable by a finite automaton. More precisely, an n ary predicate P is given by a letter to letter n automaton [29, 34] These structures were also ....

D. Harel. Towards a theory of recursive structures. In MFCS'98, pages 36--53.

....interested in database theory or computer science as such, may have the objection that N embeddable structures in general cannot be represented in the finite 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 respective relation. Of course, our collapse results for the classes 5qb or 5q ,b are still applicable when restricting attention to recursive structures in 4 An ....

D. Harel. Towards a theory of recursive structures. In L. Brim, J. Gruska, and J. Zlatuska, editors, MFCS'98: 23rd International Symposium on Mathematical Foundations of Computer Science, volume 1450 of Lecture Notes in Computer Science, pages 36 53, Brno, Czech Republic, August 1998. Springer.

.... RC(S reg;left ) We nd that each of these languages satis es all three of the required criteria, while considerably extending the expressive power of RC(S) 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 by a nite automaton. More precisely, an n ary predicate P is given by a letter to letter n automaton [29, 34] These structures were also studied in [45] in ....

D. Harel. Towards a theory of recursive structures. In MFCS'98, pages 36-53.

.... They have been studied quite intensively in model theory since the 1960s (see e.g. 2, 19] Although recursive model theory is very di#erent from finite model theory, there have been some papers studying classical issues of finite model theory on recursive structures and recursive databases [24, 27, 28, 40]. However, for most applications, the domain of recursive structures is far too large. In general, only quantifier free formulae admit e#ective evaluation algorithms. Constraint databases are a modern database model admitting infinite relations that are finitely presented by quantifier free ....

D. Harel, Towards a theory of recursive structures, in Proceedings of 23rd International Symposium on Mathematical Foundations of Computer Science MFCS 98, vol. 1450 of Lecture Notes in Computer Science, Springer, 1998, pp. 36--53.

.... have been studied quite intensively in model theory since the 1960s (see e.g. 6, 37] Although recursive model theory is very different from finite model theory, there have recently been some papers studying classical issues of finite model theory on recursive structures and recursive databases [45, 59, 60, 86]. However, for most applications, the domain of recursive structures is far too large. In general, only quantifier free formulae admit effective evaluation algorithms. Constraint databases are a modern database model admitting infinite relations that are finitely presented by quantifier free ....

D. HAREL, Towards a theory of recursive structures, in Proceedings of 23rd International Symposium on Mathematical Foundations of Computer Science MFCS 98, vol. 1450 of Lecture Notes in Computer Science, Springer, 1998, pp. 36-53. 88

....the results we present here were used in [7] to give expressiveness and complexity bounds for the database query languages that arise from several algebras of de nable sets. Our approach was also motivated by the study of automatic structures [22, 9] which are a subclass of recursive structures [21], and were introduced recently as a generalization of automatic groups [16] In an automatic structure M = h ; i, every predicate in is de nable by a nite automaton. More precisely, an n ary predicate P is given by a letter to letter n automaton [15, 18] Such an automaton is a usual DFA ....

D. Harel. Towards a theory of recursive structures. In MFCS'98, pages 36-53.

....the L theory of every A 2 K is decidable. A class of infinite structures that have been studied quite intensively in model theory are recursive structures. There have recently been some papers proposing the study of recursive structures (e.g. recursive databases) for the issues just mentioned [14, 15, 22]. However, the class of recursive structures is too large since, in general, only the quantifier free formulae admit effective evaluation algorithms. Other classes of infinite structures where the relationship of definability and complexity has been studied include metafinite structures [12] and ....

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.

....[11] for regular graphs, and in [9] for prexrecognizable graphs. As shown in [18] the class of graphs described there has decidable CTL [10] and S1S [4] and the decidability of the modal calculus [21] and even of the monadic secondorder logic is conjectured. Very dioeerent motivations appear in [16]. The author of that paper is interested in connections between problems on nite graphs and their innite equivalents. Since any recursive presentation makes sense with respect to this goal, the author stipulates the use of either terminating Turing machines that recognize the edge relation or some ....

....equivalent means. Among the presentations reviewed above two kinds may be distinguished: those where the graph is dened up to isomorphism and those where the vertices are explicitly named. We shall call the former external and the latter internal. According to this classication, presentations of [6, 7, 16, 22, 25] are internal and those of [1, 11, 17] are external. Concerning [9] one of the two presentations of 1 In order to avoid a confusion, the terms of HRequational and VRequational are used in [2] 2 In fact, the primary motivation comes here from the combinatorial semigroup theory. 3 the paper ....

D. Harel. Towards a theory of recursive structures. In L. Brim, J. Gruska, and J. Zlatuska, editors, Mathematical Foundations of Computer Science, LNCS 1450, pages 3653, Brno, Aug. 1998.

....active for some years now, where it is investigated in how far the approach and methods of descriptive complexity theory can be applied to in nite, but nitely representable structures. Research here considers various formalisms to represent in nite structures, examples being recursive structures [14], meta nite structures and complexity theory over the reals [8; 10] and constraint databases. In this research area the addition of xed points to logics is still an open problem. The paper is organized as follows. In the next section we give a precise de nition of constraint databases and ....

D. Harel. Towards a theory of recursive structures. In Proceedings of 23rd International Symposium on Mathematical Foundations of Computer Science MFCS 98, volume 1450 of Lecture Notes in Computer Science, pages 36-53. Springer, 1998.

....the L theory of every A # K is decidable. A class of infinite structures that have been studied quite intensively in model theory are recursive structures. There have recently been some papers proposing the study of recursive structures (e.g. recursive databases) for the issues just mentioned [14, 15, 22]. However, the class of recursive structures is too large since, in general, only the quantifier free formulae admit effective evaluation algorithms. Other classes of infinite structures where the relationship of definability and complexity has been studied include metafinite structures [12] and ....

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.

No context found.

D. Harel. Towards a theory of recursive structures. In Proceedings of 23rd International Symposium on Mathematical Foundations of Computer Science MFCS 98, volume 1450 of Lecture Notes in Computer Science, pages 36-53. Springer, 1998.

No context found.

D. Harel, Towards a theory of recursive structures, in Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science, MFCS 98, of Lecture Notes in Computer Science, vol. 1450, Springer-Verlag, Berlin, 1998, pp. 36--53.

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