Name
Title | ||
|---|---|---|
A heuristic to find initial values for stochastic local search in SAT using continuous extensions of Boolean formulas. |
Abstract | ||
|---|---|---|
Stochastic Local Search (SLS) is one of the most popular approaches to Boolean satisfiability problem and solvers based on this algorithm have made a substantial progress over the years. However, nearly all state of the art SLS solvers do not attempt to find a good starting point, instead using random values. We present a heuristic for finding an initial assignment based on non-linear optimization of continuous extension of given Boolean formula. This heuristic works by optimizing continuous function that represents the formula and then converting the result into discrete values. We also provide experimental evaluation of new heuristic implemented in ProbSAT solver. |
Year | Venue | Field |
|---|---|---|
2017 | East-West Design & Test Symposium | Continuous function,Heuristic,Mathematical optimization,Computer science,Boolean satisfiability problem,AC power,Local search (optimization),Solver,True quantified Boolean formula,Boolean expression |
DocType | ISSN | Citations |
Conference | 2373-826X | 0 |
PageRank | References | Authors |
0.34 | 1 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nikita Putikhin | 1 | 0 | 0.34 |
| N. Kascheev | 2 | 0 | 1.35 |