Showing cs.LOShow all
2 papers · 1 filter
cs.LO2025
Verifying Quantized GNNs With Readout Is Decidable But Highly Intractable
Artem Chernobrovkin, Marco Sälzer, François Schwarzentruber +1
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…
cs.LO2025
Verifying Quantized Graph Neural Networks is PSPACE-complete
Marco Sälzer, François Schwarzentruber, Nicolas Troquard
In this paper, we investigate the verification of quantized Graph Neural Networks (GNNs), where some fixed-width arithmetic is used to represent numbers. We introduce the linear-co…