activity
20212026
most citedVerifying And Interpreting Neural Networks using Finite Automata

3 citations · 3 across the 6 of their papers we have counts for

collaborators
Showing 2024Show all

1 paper · 1 filter

cs.LO2024

Transformer Encoder Satisfiability: Complexity and Impact on Formal Reasoning

Marco Sälzer, Eric Alsmann, Martin Lange

We analyse the complexity of the satisfiability problem, or similarly feasibility problem, (trSAT) for transformer encoders (TE), which naturally occurs in formal verification or i…