Marcelo Arenas, Pablo Barcelo, Leonid Libkin  Home/Search
Context
Related
| toronto.edu/~libkin/paper...csl04.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: toronto.edu/~libkin/publ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Locality notions in logic say that the truth value of a formula can be determined locally, by looking at the isomorphism type of a small neighborhood of its free variables. Such notions have proved to be useful in many applications. They all, however, refer to isomorphism of neighborhoods, which most local logics cannot test for. A more relaxed notion of locality says that the truth value of a formula is determined by what the logic itself can say about that small neighborhood. Or, since ... (Update)
Active bibliography (related documents): More All
2.5: Game-based Notions of Locality over Finite Models - Arenas, Barcelo, Libkin (Correct)
0.5: Logics Capturing Local Properties - Libkin (2001) (Correct)
0.5: Modelling Real-Time Database Systems in Duration Calculus - Van Hung, Van Hung (2002) (Correct)
Similar documents based on text: More All
0.5: What's Hard about XML Schema Constraints? - Arenas, Fan, Libkin (Correct)
0.2: A Normal Form for XML Documents - Arenas, Libkin (Correct)
0.2: Locally Consistent Transformations and Query.. - Arenas.. (2004) (Correct)
BibTeX entry: (Update)
@misc{ arenas-gamebased,
author = "Marcelo Arenas and Pablo Barcelo and Leonid Libkin",
title = "Game-based Notions of Locality over Finite Models",
url = "citeseer.ist.psu.edu/660739.html" }
Citations (may not include all citations):116 On local and non-local properties (context) - Gaifman - 1982
54 and logarithmic space (context) - Etessami, ers et al. - 1997
53 Data exchange: semantics and query answering - Fagin, Kolaitis et al. - 2003
49 Model-theoretic methods in the study of elementary logic (context) - Hanf - 1965
49 On monadic NP vs monadic co-NP (context) - Fagin, Stockmeyer et al. - 1994
44 Information and Computation (context) - Hella, in - 1996
31 Notions of locality and their logical characterizations over.. - Hella, Libkin et al. - 1999
30 Extended logics: the general framework (context) - Ebbinghaus - 1985
24 Logics with aggregate operators - Hella, Libkin et al. - 2001
17 Easier ways to win logical games - Fagin - 1997
17 On counting logics and local properties - Libkin - 2000
14 Describing graphs: A rst order approach to graph canonizatio.. (context) - Immerman, Lander - 1990
9 Generalized quanti ers and pebble games on nite structures (context) - Kolaitis, an - 1995
5 Fixed-parameter tractability (context) - Flum, Grohe - 2001
5 Locality of order-invariant rst-order formulas (context) - Grohe, Schwentick - 2000
3 Algorithmic aspects of the Feferman-Vaught Theorem (context) - Makowsky - 2004
3 Locally consistent transformations and query answering in da.. - Arenas, Barcel et al. - 2004
3 An existential locality theorem - Grohe, ohrle - 2001
2 Annals of Pure and Applied Logic (context) - Keisler, Lotfallah et al. - 2004
2 Veri able properties of database transactions (context) - Benedikt, Grin et al. - 1998
2 Lower bounds for invariant queries in logics with counting - Libkin, Wong - 2002
1 On winning strategies with unary quanti (context) - Nurmonen
Documents on the same site (http://www.cs.toronto.edu/~libkin/publ.html): More
Expressive Power of SQL - Libkin (2001) (Correct)
Logics Capturing Local Properties - Libkin (2001) (Correct)
Lower Bounds for Invariant Queries in Logics with Counting - Libkin, Wong (2002) (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