We propose a new local search platform that splits a CNF formula into three sub-components: i) a minimal dependency lattice (representing the core connections between logic gates)...
An important challenge within hyper-heuristic research is to design search methodologies that work well, not only across different instances of the same problem, but also across di...
Edmund K. Burke, Timothy Curtois, Matthew R. Hyde,...
Local search is widely applied to satisfiable SAT problems, and on some problem classes outperforms backtrack search. An intriguing challenge posed by Selman, Kautz and McAlleste...