A Logic for Reasoning About Aggregate-Combine Graph Neural Networks
<|reference_start|>A Logic for Reasoning About Aggregate-Combine Graph Neural Networks: We propose a modal logic in which counting modalities appear in linear inequalities. We show that each formula can be transformed into an equivalent graph neural network (GNN). We also show that a broad class of GNNs can be transformed efficiently into a formula, thus significantly improving upon the literature about the logical expressiveness of GNNs. We also show that the satisfiability problem is PSPACE-complete. These results bring together the promise of using standard logical methods for reasoning about GNNs and their properties, particularly in applications such as GNN querying, equivalence checking, etc. We prove that such natural problems can be solved in polynomial space.<|reference_end|>
@article{nunn2024a,
    title={A Logic for Reasoning About Aggregate-Combine Graph Neural Networks},
    author={Pierre Nunn, Marco S"alzer, Franc{c}ois Schwarzentruber, Nicolas
  Troquard},
    journal={arXiv preprint arXiv:2405.00205},
    year={2024},
    archivePrefix={arXiv},
    eprint={2405.00205},
    primaryClass={cs.AI cs.LG cs.LO}
}