A Complete SAT Solver for Satisfiability problem

SAT solver plays an important role in cryptography, computer design, VLSI design. SAT is a NP-complete problem. In this paper a greedy algorithm is designed to find a complete SAT solver. There are strong incomplete SAT solvers; still complete SAT solvers have their own importance. Sometimes we need all the satisfiable instances for SAT problems. This algorithm describes how to get all the satisfiable instances of a SAT problem. This algorithm starts with all satisfiable instances of a clause present in a CNF Boolean function. Then these instances are improved to satisfy all the clauses present in the Boolean function. Complexity of SAT solvers inform about the strength of security systems. Harder the SAT solver, stronger the security system. So SAT solvers are tools to design the strong security systems. It is also helpful for VLSI design. Defectives in VLSI design can be detected by SAT solvers. In this paper a greedy algorithm is discussed for complete Sat solver. SAT is NP-complete problem. Complete SAT solvers provide all the satisfiable instances for a SAT problem. In case of Incomplete SAT problem, either one satisfiable instance is obtained or nothing can be said about existence of an instance. Comparison to incomplete SAT solver, complete SAT solver has many alternatives for design issue.