Corpus ID: 8948851

Concurrent Cube-and-Conquer

@article{Tak2014ConcurrentC,
  title={Concurrent Cube-and-Conquer},
  author={Peter van der Tak and Marijn J. H. Heule and Armin Biere},
  journal={ArXiv},
  year={2014},
  volume={abs/1402.4465}
}
  • Peter van der Tak, Marijn J. H. Heule, Armin Biere
  • Published in ArXiv 2014
  • Computer Science, Mathematics
  • 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… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    2
    Twitter Mentions

    Citations

    Publications citing this paper.

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 10 REFERENCES

    Conflict-Driven Clause Learning SAT Solvers

    VIEW 1 EXCERPT

    SATzilla: Portfolio-based Algorithm Selection for SAT

    VIEW 3 EXCERPTS

    An Extensible SAT-solver

    VIEW 1 EXCERPT

    Temporal induction by incremental SAT solving

    VIEW 1 EXCERPT