DHNs with max/sum/mean aggregations correspond to UNFO and extensions with counting quantifiers, enabling decidability analysis for emptiness and subsumption problems.
On recognizing graphs by numbers of homomorphisms.Journal of Graph Theory, 64(4):330–342
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DB 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Expressive Power of Deep Homomorphism Networks over Relational Databases
DHNs with max/sum/mean aggregations correspond to UNFO and extensions with counting quantifiers, enabling decidability analysis for emptiness and subsumption problems.