Decomposing Hard SAT Instances with Metaheuristic Optimization

Daniil Chivilikhin, Artem Pavlenko, Alexander Semenov

In the article, within the framework of the Boolean Satisfiability problem (SAT), the problem of estimating the hardness of specific Boolean formulas w.r.t. a specific complete SAT…