V. Vianu. Databases and finite-model theory. In N. Immerman and Ph. Kolaitis, editors, Descriptive Complexity and Finite Models, volume 31 of AMS DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 97--148. American Mathematical Society, 1997. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Automata, Logic, and XML - Neven (2002) (Correct)
....Introduction Since Codd [11] databases have been modeled as first order relational structures and database queries as mappings from relational structures to relational structures. It is, hence, not surprising that there is an intimate connection between database theory and (finite) model theory [58, 60]. As argued by Vianu, finite model theory provides the backbone for database query languages, while in turn, database theory provides a scenario for finite model theory. More precisely, database theory induces a specific measure of relevance to finite model theory questions and provides research ....
V. Vianu. Databases and finite-model theory. In N. Immerman and Ph. Kolaitis, editors, Descriptive Complexity and Finite Models, volume 31 of AMS DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 97--148. American Mathematical Society, 1997.
Dynamic Tree Isomorphism via First-order Updates to a Relational .. - Etessami (5 citations) (Correct)
....will be judged appropriate, but several have been proposed. See, e.g. MSVT94] See [PI97] for a brief summary of proposed models and references. In the context of databases, there is by now substantial literature on dynamic query evaluation, a.k.a. incremental view maintenance (see, e.g. [BLT86, QW91, DS93, GMS93, PI97, DS95, GL95, GM95, Via97, DS97a]) Much of this work (e.g. GMS93] is concerned with efficiently recomputing views when the query itself is expressible in a restricted language, such as SQL. In this paper our concern is somewhat different. The goal is to evaluate various queries which aren t necessarily expressible statically ....
V. Vianu. Databases and finite model theory. In N. Immerman and P. Kolaitis, editors, Descriptive Complexity Theory, volume 31 of DIMACS series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society, 1997.
On the Unusual Effectiveness of Logic in Computer Science - Halpern, Harper.. (2001) (1 citation) Self-citation (Vianu) (Correct)
....the Unusual Effectiveness of Logic in Computer Science Joseph Y. Halpern y Robert Harper z Neil Immerman x Phokion G. Kolaitis Moshe Y. Vardi k Victor Vianu January 2001 1 Introduction and Overview In 1960, E.P. Wigner, a joint winner of the 1963 Nobel Prize for Physics, published a paper titled On the Unreasonable Effectiveness of Mathematics in the Natural Sciences [Wig60] This paper can be construed as an examination and affirmation of ....
....past one hundred years came from mathematics. This paper summarizes a symposium, by the same title, which was held at the 1999 Meeting of the American Association for the Advancement of Science. The authors wrote the following: Section 1 and 7 Kolaitis, Section 2 Immerman, Section 3 Vianu, Section 4 Harper, Section 5 Halpern, and Section 6 Vardi. y Cornell University. Work partially supported by NSF Grant IRI 96 25901. z Carnegie Mellon University Work partially supported by NSF Grant CCR 9502674 and DARPA Contract F19628 95 C 0050. x University of Massachusetts, ....
[Article contains additional citation context not shown here]
V. Vianu. Databases and finite-model theory. In Descriptive Complexity and Finite Models. 18
On the Unusual Effectiveness of Logic in Computer Science - Halpern, Harper.. (2000) (1 citation) Self-citation (Vianu) (Correct)
....theory is [Mai83] followed more recently by [AHV95] The latter text also described database query languages beyond FO, including fixpoint logics. An excellent survey of relational database theory is provided in [Kan91] The relationship between finite model theory and databases is discussed in [Via97] 4 Type Theory in Programming Language Research In the 1980 s and 1990 s the study of programming languages was revolutionized by a remarkable confluence of ideas from mathematical and philosophical logic and theoretical computer science. Type theory emerged as a unifying conceptual framework ....
V. Vianu. Databases and finite-model theory. In N. Immerman and P. Kolaitis, editors, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 31, pages 97-- 148. American Mathematical Society, 1997.
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