SOURCE-LINKED INTELLIGENCE

Recurrent GraphNeural NetworkswithSet-BasedAggregation

arXiv · AI, language, vision and robotics · article · Sep 14, 2026 · UTC

Recurrent GNNs iterate message passing to convergence, and their logical characterizations to date rely on multi-set aggregation, graded (counting) logics, and halting or acceptance conditions that cannot be verified from the network's parameters. We study recurrent GNNs with set-based aggregation and identify sufficient conditions checkable from the weights for networks to compile into formulas and formulas into networks. The main result is an effective, two-directional equivalence between a class of networks and the Boolean closure of reachability and safety properties, the fragment B$Σ^{\ci

Read original source ↗ Open in workspace

recordType

paper

region

Global