High Quality Content by WIKIPEDIA articles! GSAT and WalkSat are local search algorithms to solve boolean satisfiability problems.Both algorithms work on formulae that are in, or have been converted into, conjunctive normal form. They start by assigning a random value to each variable. If the assignment satisfies all clauses, the algorithm terminates, returning the assignment. Otherwise, a variable is flipped and the above is then repeated until all the clauses are satisfied. WalkSAT and GSAT differ in the methods used to select which variable to flip.GSAT makes the change which minimizes the number of unsatisfied clauses in the new assignment, possibly with some probability instead of picking a variable at random.

Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.