Locality and Hard SAT-Instances

Klas Markström, Daniel Le Berre, Laurent Simon
2006 Journal on Satisfiability, Boolean Modeling and Computation  
In this note we construct a family of SAT-instance based on Eulerian graphs which are aimed at being hard for resolution based SAT-solvers. We discuss some experiments made with instances of this type and how a solver can try to avoid at least some of the pitfalls presented by these instances. Finally we look at how the density of subformulae can influence the hardness of SAT instances.
doi:10.3233/sat190024 fatcat:y3z7fqup3zalba22qtraboyiuu