Abstract:

The Boolean satisfiability problem (SAT) is fundamental in many fields of computer science; so its fast solution is of great significance. The Solar algorithm is one of the famous quick SAT solutions. We combine the basic Solar algorithm with geometric programming method to propose a novel continuous solution of SAT problem. Experiments demonstrate that the proposal has potential applicable value for solving SAT problems.

Key words: SAT;solar algorithm;geometric programming