Choosing Probability Distributions for Stochastic Local Search and the Role of Make versus Break

Balint, Adrian; Schöning, Uwe

doi:10.1007/978-3-642-31612-8_3

Cited by 76 publications

(125 citation statements)

References 11 publications

Supporting

Mentioning

124

Contrasting

Order By: Relevance

“…As one result of our implementation analysis, we have figured out that the break l value can be computed very easily within the non-caching implementations and consequently analyzed its role in the probSAT solver. The authors of [2] also mention that the role of make should not be neglected as was shown in [4]. This is of course true for their findings, but as the make and break value are complements of each other, it is sufficient to consider only the break value.…”

Section: Related Workmentioning

confidence: 99%

Improving Implementation of SLS Solvers for SAT and New Heuristics for k-SAT with Long Clauses

Balint

Biere

Fröhlich

et al. 2014

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. Stochastic Local Search (SLS) solvers are considered one of the best solving technique for randomly generated problems and more recently also have shown great promise for several types of hard combinatorial problems. Within this work, we provide a thorough analysis of different implementation variants of SLS solvers on random and on hard combinatorial problems. By analyzing existing SLS implementations, we are able to discover new improvements inspired by CDCL solvers, which can speed up the search of all types of SLS solvers. Further, our analysis reveals that the multilevel break values of variables can be easily computed and used within the decision heuristic. By augmenting the probSAT solver with the new heuristic, we are able to reach new stateof-the-art performance on several types of SAT problems, especially on those with long clauses. We further provide a detailed analysis of the clause selection policy used in focused search SLS solvers.

show abstract

Section: Related Workmentioning

confidence: 99%

Improving Implementation of SLS Solvers for SAT and New Heuristics for k-SAT with Long Clauses

Balint

Biere

Fröhlich

et al. 2014

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…The heuristic to choose a literal to be flipped is the key of the search, and determines the performance of the algorithm. Many heuristics have been proposed for this reason [1]- [4], [19], [20]. Among them, WSAT/SKC [1] is the basis of our proposed method.…”

Section: Related Workmentioning

confidence: 99%

“…Sophisticated SLS algorithms such as [3], [4], [19] have been proposed, but their control structures and the required memory access sequences are complex, and it is not easy to implement them in hardware. In [21], an FPGA solver for probSAT [20], one of the latest SLS algorithms, is proposed. In probSAT, selecting next flip variable is based only on probability distribution calculated by an elementary function.…”

Section: Related Workmentioning

confidence: 99%

An Approach for Solving SAT/MaxSAT-Encoded Formal Verification Problems on FPGA

Kanazawa

Matsumoto

2017

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

SUMMARYWalkSAT (WSAT) is one of the best performing stochastic local search algorithms for the Boolean Satisfiability (SAT) and the Maximum Boolean Satisfiability (MaxSAT). WSAT is very suitable for hardware acceleration because of its high inherent parallelism. Formal verification of digital circuits is one of the most important applications of SAT and MaxSAT. Structural knowledge such as logic gates and their dependencies can be derived from SAT/MaxSAT instances generated from formal verification of digital circuits. Such that knowledge is useful to solve these instances efficiently. In this paper, we first discuss a heuristic to utilize the structural knowledge for solving these problems by using WSAT. Then, we show its implementation on FPGA. The problem size of the formal verification is typically very large, and most data have to be placed in offchip DRAMs. In this situation, the acceleration by FPGA is limited by the throughput and access latency of the DRAMs. In our implementation, data are carefully mapped on the on-chip memory banks and off-chip DRAMs so that most data in the off-chip DRAMs can be continuously accessed using burst-read. Furthermore, a variable-way cache memory comprised of the on-chip memory banks is used in order to hide the DRAM access latency by caching the head portion of the continuous read from the DRAMs and giving them to the circuit till the rest portion is started to be given by the burst-read. We evaluate the performance of our proposed method by changing configuration of the variable-way cache and the processing parallelism, and discuss how much acceleration can be achieved.

show abstract

“…We focus our attention on three SAT local search solvers (Sparrow [21], probSAT [22], and g2wsat [23]), and a TSP local search solver LKH [10]. We recall that these solvers are among the best solvers in their particular domains and we use WEKA (version 3.6.2), a popular ML library to build the ML models.…”

Section: Experimental Evaluationmentioning

confidence: 99%

“…The random SAT set of instances has been used previously in [24] and [22] and we use the software portgen to randomly generate TSP instances. The set of structured SAT instances has been proposed in [25] and previously in [26], and we collected structured TSP instances from OpenStreetMaps (osm).…”

Section: Experimental Evaluationmentioning

confidence: 99%

Learning Sequential and Parallel Runtime Distributions for Randomized Algorithms

Arbeláez

Truchet

O’Sullivan³

2016

2016 IEEE 28th International Conference on Tools With Artificial Intelligence (ICTAI)

View full text Add to dashboard Cite

Choosing Probability Distributions for Stochastic Local Search and the Role of Make versus Break

Cited by 76 publications

References 11 publications

Improving Implementation of SLS Solvers for SAT and New Heuristics for k-SAT with Long Clauses

Improving Implementation of SLS Solvers for SAT and New Heuristics for k-SAT with Long Clauses

An Approach for Solving SAT/MaxSAT-Encoded Formal Verification Problems on FPGA

Learning Sequential and Parallel Runtime Distributions for Randomized Algorithms

Contact Info

Product

Resources

About