A randomized diversification strategy for solving satisfiability problem with long clauses

• DOI: 10.1007/s11432-016-0258-4
• Publication Date: 2017-05-15T05:38:16Z
• Authors: Jian Gao; Ruizhi Li; Minghao Yin
• Keywords: Satisfiability; Boolean satisfiability problem; Efficient algorithm

Satisfiability problem (SAT) is a central problem in artificial intelligence due to its computational complexity and usefulness in industrial applications. Stochastic local search (SLS) algorithms are powerful to solve hard instances of satisfiability problems, among which CScoreSAT is proposed for solving SAT instances with long clauses by using greedy mode and diversification mode. In this paper, we present a randomized variable selection strategy to improve efficiency of the diversification mode, and thus propose a new SLS algorithm. We perform a number of experiments to evaluate the new algorithm comparing with the recently proposed algorithms, and show that our algorithm is comparative with others for solving random instances near the phase transition threshold.