An algorithm of the variable selection for solving SAT problems based on the literal weights
Xiaorui Wu, Zhenming Song · 2016
In this paper, we propose a new variable decision strategy for solving SAT problems based on literal weights. The new algorithm makes use of the information from the structure of SAT problems into literal weights. We first consider the short clause can be satisfied, and select the literal of the largest literal weights is assigned. A new operator of literal Weights is designed to prevent conflicting in the process of solving problems. We use multiple attribute factors, combine with the length of the clause and the number of the literal occurrences, analyze the relationship between literals and clauses, and the literal weights is defined. To demonstrate the feasibility and the effectiveness of the new algorithm, we give an example to illustrate to solve the final solution.