A zero-one law for logic with a fixed-point operator
Information and Control
Relational queries computable in polynomial time
Information and Control
Infinitary logic and inductive definability over finite structures
Information and Computation
On a monadic NP vs monadic co-NP
Information and Computation
On the complexity of bounded-variable queries (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Queries with arithmetical constraints
Theoretical Computer Science - Special issue: principles and practice of constraint programming
Local properties of query languages
Theoretical Computer Science - Special issue on the 6th International Conference on Database Theory—ICDT '97
Logics with counting and local properties
ACM Transactions on Computational Logic (TOCL)
Locality of order-invariant first-order formulas
ACM Transactions on Computational Logic (TOCL)
Logics with aggregate operators
Journal of the ACM (JACM)
Query automata over finite trees
Theoretical Computer Science
Parameterized complexity for the database theorist
ACM SIGMOD Record
The Complexity of First-Order and Monadic Second-Order Logic Revisited
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Monadic datalog and the expressive power of languages for Web information extraction
Journal of the ACM (JACM)
Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)
Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)
Two-variable logic on data trees and XML reasoning
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Finite Model Theory and Its Applications (Texts in Theoretical Computer Science. An EATCS Series)
Finite Model Theory and Its Applications (Texts in Theoretical Computer Science. An EATCS Series)
Journal of Computer and System Sciences
On the constant-depth complexity of k-clique
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Constraint Databases
| Hi-index | 0.00 |
For many years, finite model theory was viewed as the backbone of database theory, and database theory in turn supplied finite model theory with key motivations and problems. By now, finite model theory has built a large arsenal of tools that can easily be used by database theoreticians without going to the basics such as combinatorial games. We survey such tools here, focusing not on how they are proved, but rather on how to apply them, as-is, in various questions that come up in database theory.