Picture for Marco Sälzer

Marco Sälzer

The Computational Complexity of Formal Reasoning for Encoder-Only Transformers

Add code
May 28, 2024
Viaarxiv icon

A Logic for Reasoning About Aggregate-Combine Graph Neural Networks

Add code
Apr 30, 2024
Figure 1 for A Logic for Reasoning About Aggregate-Combine Graph Neural Networks
Figure 2 for A Logic for Reasoning About Aggregate-Combine Graph Neural Networks
Figure 3 for A Logic for Reasoning About Aggregate-Combine Graph Neural Networks
Figure 4 for A Logic for Reasoning About Aggregate-Combine Graph Neural Networks
Viaarxiv icon

Verifying And Interpreting Neural Networks using Finite Automata

Add code
Nov 02, 2022
Viaarxiv icon

We Cannot Guarantee Safety: The Undecidability of Graph Neural Network Verification

Add code
Jun 10, 2022
Figure 1 for We Cannot Guarantee Safety: The Undecidability of Graph Neural Network Verification
Figure 2 for We Cannot Guarantee Safety: The Undecidability of Graph Neural Network Verification
Figure 3 for We Cannot Guarantee Safety: The Undecidability of Graph Neural Network Verification
Viaarxiv icon

Reachability In Simple Neural Networks

Add code
Mar 15, 2022
Figure 1 for Reachability In Simple Neural Networks
Figure 2 for Reachability In Simple Neural Networks
Figure 3 for Reachability In Simple Neural Networks
Figure 4 for Reachability In Simple Neural Networks
Viaarxiv icon

Reachability Is NP-Complete Even for the Simplest Neural Networks

Add code
Sep 01, 2021
Figure 1 for Reachability Is NP-Complete Even for the Simplest Neural Networks
Figure 2 for Reachability Is NP-Complete Even for the Simplest Neural Networks
Figure 3 for Reachability Is NP-Complete Even for the Simplest Neural Networks
Figure 4 for Reachability Is NP-Complete Even for the Simplest Neural Networks
Viaarxiv icon