Sufficient and necessary conditions for SAT
Cheng Guo · Science and Technology of West China · 2007
Satisfiability problem abbreviated to SAT is a very important problem in computer science and artificial intelligence and is firstly proved to be a NPC problem.In this paper,the sets of clauses are researched,giving the definitions of flipping,simple sets of clauses and flipping isomorphism.Moreover,I prove that flipping doesn't affect the satisfiability of a set of clauses and three sufficient and necessary conditions are proved.In the end of this paper,it is simply discussed that these conditions can be utilized in complete algorithm and incomplete algorithm of SAT.