SIGACT news complexity theory column 49
ACM SIGACT News
On preservation under homomorphisms and unions of conjunctive queries
Journal of the ACM (JACM)
On digraph coloring problems and treewidth duality
European Journal of Combinatorics
Forbidden lifts (NP and CSP for combinatorialists)
European Journal of Combinatorics
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Homomorphism preservation theorems
Journal of the ACM (JACM)
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
One Useful Logic That Defines Its Own Truth
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
A Modal-Logic Based Graph Abstraction
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Dualities for Constraint Satisfaction Problems
Complexity of Constraints
A Logical Approach to Constraint Satisfaction
Complexity of Constraints
Structural characterizations of schema-mapping languages
Proceedings of the 12th International Conference on Database Theory
The complexity of satisfiability problems: Refining Schaefer's theorem
Journal of Computer and System Sciences
Universal algebra and hardness results for constraint satisfaction problems
Theoretical Computer Science
Structural characterizations of schema-mapping languages
Communications of the ACM - Amir Pnueli: Ahead of His Time
Survey: Colouring, constraint satisfaction, and complexity
Computer Science Review
Finite model theory on tame classes of structures
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
NP by means of lifts and shadows
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Model theory makes formulas large
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Hi-index | 0.00 |
We prove the Finite Homomorphism Preservation Theorem: a first-order formula is preserved underhomomorphisms on finite structures iff it is equivalent in the finite to an existential positive formula. We also strengthen the classical homomorphism preservation theorem by showing that a formula is preserved under homomorphisms on all structures iff it is equivalent to an existential positive formula of the same quantifier rank. Our method involves analysis of existential positive types and a new notion of existential positive saturation.