Verifying Quantized GNNs With Readout Is Decidable But Highly Intractable

arXiv:2510.08045v2 Announce Type: replace-cross Abstract: We introduce a logical language for reasoning about quantized aggregate-combine graph neural networks with global readout (ACR-GNNs). We provide a logical characterization and use it to prove that verification tasks for quantized GNNs with...