DHNs with max/sum/mean aggregations correspond to UNFO and extensions with counting quantifiers, enabling decidability analysis for emptiness and subsumption problems.
Formally atom(v(i) 1 ) = atom(v (i) 2 ) for each 1≤i≤m and ind(v(i) 1 )≤ind(v (j) 1 )↔ ind(v(i) 2 )≤ind(v (j) 2 )for each1≤i, j≤m
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.