3 ms·
Iirc graph ConvNets have been successfully applied to some Boolean Sat problems.
by deepnotderp 10y ago
Iirc graph ConvNets have been successfully applied to some Boolean Sat problems.
- letitgo12345 10y agoOnly ones I've seen try and predict the satisfiability directly. But usually in SAT, you're either interested in a solution or a proof of infeasibility. Prediction can't do the latter and afaik, existing non-ML based SAT solvers are far better at doing the former.