203 citations · 391 across the 22 of their papers we have counts for
Showing 2014Show all
3 papers · 1 filter
cs.DS2014
Concurrent Cube-and-Conquer
Peter van der Tak, Marijn J. H. Heule, Armin Biere
Recent work introduced the cube-and-conquer technique to solve hard SAT instances. It partitions the search space into cubes using a lookahead solver. Each cube is tackled by a con…
cs.DS2014★ 18 cited
Symbiosis of Search and Heuristics for Random 3-SAT
Sid Mijnders, Boris de Wilde, Marijn Heule
When combined properly, search techniques can reveal the full potential of sophisticated branching heuristics. We demonstrate this observation on the well-known class of random 3-S…
cs.AI2014★ 8 cited
Towards Ultra Rapid Restarts
Shai Haim, Marijn Heule
We observe a trend regarding restart strategies used in SAT solvers. A few years ago, most state-of-the-art solvers restarted on average after a few thousands of backtracks. Curren…