21. Solvers include satisfiability modulo theories solvers. 22. One is the satisfiability problem, a notoriously difficult computer science problem that involves lengthy logical equations. 23. For years, computer scientists have pondered the daunting task of solving what they call satisfiability problems. 24. WalkSAT has been proven particularly useful in solving satisfiability problems produced by conversion from automated planning problems. 25. Local consistency proves satisfiability in some restricted cases ( see Complexity of constraint satisfaction # Restrictions ). 26. These operations are aimed at making the constraint store simpler to be checked for satisfiability and solved. 27. Another important development was the recent emergence of much more efficient boolean satisfiability ( SAT ) solvers. 28. There exist algorithms that can compute the satisfiability of a 2-SAT problem in polynomial time. 29. An instance of the satisfiability problem should have a valid proof if and only if it is satisfiable. 30. There are two parts to proving that the Boolean satisfiability problem ( SAT ) is NP-complete.
