Logics with counting and local properties
ACM Transactions on Computational Logic (TOCL)
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Local Properties of Query Languages
ICDT '97 Proceedings of the 6th International Conference on Database Theory
On the Forms of Locality over Finite Models
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Logics with Aggregate Operators
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Logics with Counting, Auxiliary Relations, and Lower Bounds for Invariant Queries
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Logics capturing local properties
ACM Transactions on Computational Logic (TOCL)
ICDT '01 Proceedings of the 8th International Conference on Database Theory
Incremental recomputation in local languages
Information and Computation
Query-preserving watermarking of relational databases and XML documents
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Theoretical Computer Science - Database theory
SIGACT news complexity theory column 49
ACM SIGACT News
On the expressive power of monadic least fixed point logic
Theoretical Computer Science - Automata, languages and programming: Logic and semantics (ICALP-B 2004)
The finite model theory toolbox of a database theoretician
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Query-preserving watermarking of relational databases and Xml documents
ACM Transactions on Database Systems (TODS)
Locality of queries definable in invariant first-order logic with arbitrary built-in predicates
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Towards a characterization of order-invariant queries over tame structures
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Model Checking for Successor-Invariant First-Order Logic on Minor-Closed Graph Classes
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
A query is local if the decision of whether a tuple in a structure satisfies this query only depends on a small neighborhood of the tuple. We prove that all queries expressible by order-invariant first-order formulas are local.