Designing New Phase Selection Heuristics

05/11/2020
by   Arijit Shaw, et al.
0

CDCL-based SAT solvers have transformed the field of automated reasoning owing to their demonstrated efficiency at handling problems arising from diverse domains. The success of CDCL solvers is owed to the design of clever heuristics that enable the tight coupling of different components. One of the core components is phase selection, wherein the solver, during branching, decides the polarity of the branch to be explored for a given variable. Most of the state-of-the-art CDCL SAT solvers employ phase-saving as a phase selection heuristic, which was proposed to address the potential inefficiencies arising from far-backtracking. In light of the emergence of chronological backtracking in CDCL solvers, we re-examine the efficiency of phase saving. Our empirical evaluation leads to a surprising conclusion: The usage of phase saving and random selection of polarity during chronological backtracking leads to indistinguishable runtime performance in terms of instances solved and PAR-2 score. We introduce Decaying Polarity Score (DPS) to capture the trend of the polarities attained by the variable, and upon observing lack of performance improvement due to DPS, we turn to a more sophisticated heuristic seeking to capture the activity of literals and the trend of polarities: Literal State Independent Decaying Sum (LSIDS). We find the 2019 winning SAT solver, Maple_LCM_Dist_ChronoBTv3, augmented with LSIDS solves 6 more instances while achieving a reduction of over 125 seconds in PAR-2 score, a significant improvement in the context of the SAT competition.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/31/2011

SATzilla: Portfolio-based Algorithm Selection for SAT

It has been widely observed that there is no single "dominant" SAT solve...
research
04/25/2019

Characterization of Glue Variables in CDCL SAT Solving

A state-of-the-art criterion to evaluate the importance of a given learn...
research
04/02/2016

Improving SAT Solvers via Blocked Clause Decomposition

The decision variable selection policy used by the most competitive CDCL...
research
08/08/2012

A Dynamic Phase Selection Strategy for Satisfiability Solvers

The phase selection is an important of a SAT Solver based on conflict-dr...
research
02/18/2014

Towards Ultra Rapid Restarts

We observe a trend regarding restart strategies used in SAT solvers. A f...
research
02/18/2014

Symbiosis of Search and Heuristics for Random 3-SAT

When combined properly, search techniques can reveal the full potential ...
research
06/09/2023

Explaining SAT Solving Using Causal Reasoning

The past three decades have witnessed notable success in designing effic...

Please sign up or login with your details

Forgot password? Click here to reset