تقرير
A Logic for Reasoning About Aggregate-Combine Graph Neural Networks
| العنوان: | A Logic for Reasoning About Aggregate-Combine Graph Neural Networks |
|---|---|
| المؤلفون: | Nunn, Pierre, Sälzer, Marco, Schwarzentruber, François, Troquard, Nicolas |
| سنة النشر: | 2024 |
| المجموعة: | Computer Science |
| مصطلحات موضوعية: | Computer Science - Artificial Intelligence, Computer Science - Machine Learning, Computer Science - Logic in Computer Science |
| الوصف: | 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. Comment: arXiv admin note: text overlap with arXiv:2307.05150 |
| نوع الوثيقة: | Working Paper |
| URL الوصول: | http://arxiv.org/abs/2405.00205 |
| رقم الأكسشن: | edsarx.2405.00205 |
| قاعدة البيانات: | arXiv |
| الوصف غير متاح. |