• # CCASat

• Referenced in 12 articles [sw12924]
• which shows promising experimental results on random 3-SAT instances, and outperforms TNM, the winner ... state-of-the-art performance on random 3-SAT instances and crafted ones ... concerns improving local search algorithms for random $k$-SAT instances with $k>3$. Although ... made great achievements in solving random 3-SAT instances, the progress lags far behind...
• # UnitWalk

• Referenced in 36 articles [sw00993]
• paper we present a new randomized algorithm for SAT, i.e., the satisfiability problem for Boolean ... verification. Our algorithm is inspired by two randomized algorithms having the best current worst-case ... local search (which is used in many SAT algorithms, e.g., in GSAT and WalkSAT...
• # YalSAT

• Referenced in 25 articles [sw31644]
• performance in the crafted track of the SAT competition. In particular ideas around ProbSAT showed ... competitive on certain hard satisfiable but non-random instances using a simple and beautiful variant ... SAT competition 2017 it actually turned out that YalSAT won the random track, which however ... Dimetheus the winner in the random track in the SAT competition 2016 was missing...
• # CCLS

• Referenced in 20 articles [sw36049]
• random walk, we design a simple SLS algorithm dubbed CCLS for weighted MAX-SAT ... broad range of weighted MAX-SAT instances. Experimental results illustrate that the quality of solution ... WPM2 on most industrial, crafted and random instances, indicating the efficiency and the robustness ... evaluated in the weighted and unweighted MAX-SAT tracks of incomplete solvers in the Eighth...
• # SATLIB Benchmark Suite

• Referenced in 3 articles [sw11916]
• random instance distributions, such as uniform Random-3-SAT; test-sets obtained by encoding instances ... from random instance distribution of SAT-encoded combinatorial problems such as Graph Colouring; and individual...
• # c-sat

• Referenced in 8 articles [sw00168]
• This paper describes a SAT Solver c-sat, a parallelization of MiniSat using ... decision heuristics and random number seeds. With careful tuning, c-sat showed good speedup over...
• # CCAnr

• Referenced in 4 articles [sw40122]
• random satisfiability. This paper presents a stochastic local search (SLS) solver for SAT named CCAnr ... strategy and has good performance on non-random SATinstances. CCAnr switches between twomodes: it flips ... utilize diversifying heuristics such as age or randomized strategies to pick a variable from ... experiments on combinatorial and application benchmarks from SAT Competition 2014 show that CCAnr has better...
• # NLocalSAT

• Referenced in 1 article [sw40123]
• effective way for solving a satisfiable SAT problem is the stochastic local search (SLS). However ... method, the initialization is assigned in a random manner, which impacts the effectiveness ... probSAT) with instances in the random track of SAT Competition 2018. The experimental results show...
• # countAntom

• Referenced in 2 articles [sw40124]
• files tab. Furthermore we provide the following #SAT specific benchmark collection: Fault Injection: Encode ... that a circuit output is ’1’ when random inputs are applied...
• # CCEHC

• Referenced in 7 articles [sw36050]
• great progress of SLS on weighted MAX-SAT and PMS, the performance ... scheme for hard clauses, and a biased random walk component. Extensive experiments demonstrate that CCEHC...
• # S-Cluster++

• Referenced in 2 articles [sw29662]
• considered to be a fusion product of random mutations over generations (vertical evolution) and genomic ... small version of the CCP to the SAT problem. Availability and implementation: The program package...