Relational queries computable in polynomial time
Information and Control
Graph rewriting: an algebraic and logic approach
Handbook of theoretical computer science (vol. B)
An analysis of fixed-point queries on binary trees
Theoretical Computer Science
Proceedings of the 30th IEEE symposium on Foundations of computer science
Isomorphism testing for embeddable graphs through definability
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Deciding first-order properties of locally tree-decomposable structures
Journal of the ACM (JACM)
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Fixed-Parameter Tractability, Definability, and Model-Checking
SIAM Journal on Computing
Definability and Descriptive Complexity on Databases of Bounded Tree-Width
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Proceedings of the 12th International Workshop on Computer Science Logic
Fixed-Point Logics on Planar Graphs
LICS '98 Proceedings of the 13th 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
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
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)
Existential Positive Types and Preservation under Homomorphisisms
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
On preservation under homomorphisms and unions of conjunctive queries
Journal of the ACM (JACM)
Approximation Schemes for First-Order Definable Optimisation Problems
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
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)
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
The Power of Counting Logics on Restricted Classes of Finite Structures
CSL '07/EACSL '07, Proceedings of the 21st international workshop and the 16th Annual Conference of the EACSL on Computer Science Logic
Preservation under extensions on well-behaved finite structures
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Towards a characterization of order-invariant queries over tame structures
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Model theory makes formulas large
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Homomorphism preservation on quasi-wide classes
Journal of Computer and System Sciences
European Journal of Combinatorics
European Journal of Combinatorics
Characterisations and examples of graph classes with bounded expansion
European Journal of Combinatorics
Interpreting nowhere dense graph classes as a classical notion of model theory
European Journal of Combinatorics
| Hi-index | 0.00 |
The early days of finite model theory saw a variety of results establishing that the model theory of the class of finite structures is not well-behaved. Recent work has shown that considering subclasses of the class of finite structures allows us to recover some good model-theoretic behaviour. This appears to be especially true of some classes that are known to be algorithmically well-behaved. We review some results in this area and explore the connection between logic and algorithms.