资源分类
》 资源 》论文》Depth-Driven Circuit-Level Stochastic Local Search for SAT Anton Belov? Matti Ja?rvisalo† Zbigniev Stachniak

Depth-Driven Circuit-Level Stochastic Local Search for SAT Anton Belov? Matti Ja?rvisalo† Zbigniev Stachniak

2019-11-12 | |  45 |   44 |   0
Abstract We develop a novel circuit-level stochastic local search (SLS) method D-CRSat for Boolean satis?ability by integrating a structure-based heuristic into the recent CRSat algorithm. D-CRSat significantly improves on CRSat on real-world application benchmarks on which other current CNF and circuit-level SLS methods tend to perform weakly. We also give an intricate proof of probabilistically approximate completeness for D-CRSat, highlighting key features of the method.

上一篇：Tackling the Partner Units Con?guration Problem?

下一篇：Tractable Set Constraints Manuel Bodirsky Martin Hils Alex Krimkevich

用户评价
全部评价

热门资源

  • Learning to learn...

    The move from hand-designed features to learned...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • Rating-Boosted La...

    The performance of a recommendation system reli...

  • Hierarchical Task...

    We extend hierarchical task network planning wi...