Paper recorded by Signals 4 on 2026-09-14 in cs.AI. Abstract reproduced from arXiv; link to the original below.
Published 2026-09-14 on arXiv · recorded by Signals 4 on 2026-09-15
Category: cs.AI · 人工智能 · first seen 2026-09-15
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 a