Local Search With Configuration Checking For Pbs

Pseudo-Boolean Satisfaction problem (PBS) has always been a hot issue in artificial intelligence research. In solving practical problems such as digital logic circuits, there are too many clauses and oversize intermediate processing files in the SAT, so PBS is more simple and quick to solve. We calculated the benefit of each variable and chose the best benefit variable as well as used configuration checking strategy to check whether the pattern had been changed to implement the solver. Finally, we added the timestamp of the algorithm to find the local optimal improvement and perform the parallel computation. The experimental results show that the rate of increase in the efficiency of time is more than the number of threads. This paper attempts to design and implement an incomplete PBS algorithm based on the configuration checking strategy, hoping to play its advantage solving the problem scale and solving the efficiency. The improvement of the solution efficiency of the PBS will help its further application in the related field.