Algorithm for finding all-solutions of satisfiablity problem
Meijing Shan · Computer Engineering and Applications Journal · 2009
Satisfiability problem has been widely used in many fields such as artificial intelligence,computer theory research and computation theory.Many algorithms about this NP-hard problem have been built,but how to get all of the truth assignments is still difficult.By establishing the correspondence between the primitive operation in polynomial and clause solution in SAT,an ef- ficient algorithm has been built to obtain all solutions which satisfied the problem.Experiment shows that the new algorithm is feasible.