← Back to all news
arXiv AI By Blai Bonet

Recurrent GraphNeural NetworkswithSet-BasedAggregation

Read the original on arXiv AI →

The paper introduces recurrent Graph Neural Networks (GNNs) that use set-based aggregation and establishes conditions that can be verified directly from the network weights. It proves a two‑directional equivalence between these networks and the Boolean closure of reachability and safety properties, corresponding to the fragment BΣ◦₁ of the modal μ‑calculus. This equivalence allows for verifiable symbolic explanations of networks that satisfy the identified conditions, without relying on counting logic or external halting signals.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

Related stories

arXiv AI
Sep 4

Complete Identification of Deep ReLU Networks through {\L}ukasiewicz Logic

The paper presents a complete characterization of when two deep ReLU networks realize the same function, showing that this occurs iff one can be transformed into the other using a set of axioms from many‑valued logic. It introduces a symbolic calculus that maps networks to substitution graphs, proves a completeness theorem linking equivalent formulas, and provides an algorithm to reconstruct networks from these graphs. The framework yields a new compositional normal form for MV logic that preserves the algebraic structure of deep ReLU networks.

By Yani Zhang, Helmut B\"olcskei
robotics
More like this →
arXiv Machine Learning
Sep 10

Modal Logic Neural Networks

arXiv:2512.03491v3 Announce Type: replace Abstract: Neural Networks are indispensable to natural sciences and society. Their impact extends from applications in public health to workforce productivit...

By Antonin Sulc, Noor Naddour
ragsafety
More like this →
arXiv Machine Learning
Aug 14

The Boolean Power of ReLU

arXiv:2608. 12617v1 Announce Type: new Abstract: We prove that, on finite simple undirected graphs equipped with a single Boolean node feature, the Boolean queries expressible in $\Sigma$-MPLang, for any collection $\Sigma$ of eventually constant activation functions and with arbitrary real coefficients, form a strict subclass of the Boolean queries expressible in ReLU-MPLang.

By Pablo Barcel\'o, Floris Geerts, Matthias Lanzinger, Klara Pakhomenko, Jan Van den Bussche
More like this →
arXiv AI
Aug 12

sLTN: Structural Logic Tensor Networks

arXiv:2608. 11136v1 Announce Type: new Abstract: Logic Tensor Networks (LTN) provide a neurosymbolic framework in which first-order logic is interpreted through tensor operations, enabling logical constraints to be integrated with differentiable learning.

By Davide Rinaldi, Luciano Serafini
More like this →