Machine Learning for SAT: Restricted Heuristics and New Graph Representations

Mikhail Shirokikh, Ilya Shenbin, Anton Alekseev +1

Boolean satisfiability (SAT) is a fundamental NP-complete problem with many applications, including automated planning and scheduling. To solve large instances, SAT solvers have to…