DeepAI AI Chat
Log In Sign Up

Concurrent Cube-and-Conquer

by   Peter van der Tak, et al.

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 conflict-driven clause learning (CDCL) solver. Crucial for strong performance is the cutoff heuristic that decides when to switch from lookahead to CDCL. Yet, this offline heuristic is far from ideal. In this paper, we present a novel hybrid solver that applies the cube and conquer steps simultaneously. A lookahead and a CDCL solver work together on each cube, while communication is restricted to synchronization. Our concurrent cube-and-conquer solver can solve many instances faster than pure lookahead, pure CDCL and offline cube-and-conquer, and can abort early in favor of a pure CDCL search if an instance is not suitable for cube-and-conquer techniques.


page 1

page 2

page 3

page 4


Symbiosis of Search and Heuristics for Random 3-SAT

When combined properly, search techniques can reveal the full potential ...

DistMS: A Non-Portfolio Distributed Solver for Maximum Satisfiability

The most successful parallel SAT and MaxSAT solvers follow a portfolio a...

Subsumption-driven clause learning with DPLL+restarts

We propose to use a DPLL+restart to solve SAT instances by successive si...

Backjumping is Exception Handling

ISO Prolog provides catch and throw to realise the control flow of excep...

DASH: Dynamic Approach for Switching Heuristics

Complete tree search is a highly effective method for tackling MIP probl...

Algorithm Selection as a Bandit Problem with Unbounded Losses

Algorithm selection is typically based on models of algorithm performanc...

ML Supported Predictions for SAT Solvers Performance

In order to classify the indeterministic termination behavior of the ope...