mlsanityData to 14 Oct 2026

Decidability of Graph Neural Networks via Logical Characterizations

arXiv 2404.18151 ↗First posted 28 Apr 2024cs.LOcited by 14

Not on the map. Why?

Abstract (arXiv)

We present results concerning the expressiveness and decidability of a popular graph learning formalism, graph neural networks (GNNs), exploiting connections with logic. We use a family of recently-discovered decidable logics involving "Presburger quantifiers". We show how to use these logics to measure the expressiveness of classes of GNNs, in some cases getting exact correspondences between the expressiveness of logics and GNNs. We also employ the logics, and the techniques used to analyze them, to obtain decision procedures for verification problems over GNNs. We complement this with undecidability results for static analysis problems involving the logics, as well as for GNN verification problems.

Key facts. Cited by 14 papers in the map (data through 14 Oct 2026). First posted on arXiv 28 Apr 2024.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 1; 2025: 9; 2026: 4.

14 papers.

Sort: