摘要
1Introduction The satisfiability(SAT)problem is always a core problem in the field of computer science.Its theoretical and applied research have long been the common attention of many scholars in the field of artificial intelligence and mathematical logic.In the real world,all issues related to combinatorial optimization and coordination verification are closely related to SAT problem.
基金
the National Natural Science Foundation of China(Grant Nos.61762019,61862051 and 62062001)
The Science and Technology Foundation of Guizhou Province(Qian Ke Ping Tai Ren Cai[2019]QNSYXM-05).
