Challenging SMT solvers to verify neural networks

Luca Pulina, Armando Tacchella · AI Communications · 2012

In recent years, Satisfiability Modulo Theory (SMT) solvers are becoming increasingly popular in the Computer Aided Verification and Reasoning community. Used natively or as back-engines, they are accumulating a record of success stories and, as witn

Read the paper · More papers on PaperTik