| Abstract: | An artificial neural network tester for the satisfiability problem of propositional calculus is presented. Satisfiability is treated as a constraint satisfaction optimization problem and, contrary to most of the existing satisfiability testers, the expressions are converted into disjunctive normal form before testing. The artificial neural network is based on the principles of harmony theory. Its basic characteristics are the simulated annealing procedure and the harmony function; the latter constitutes a measure of the satisfiability of the expression under the current truth assignment to its variables. The tester is such that: (a) the satisfiability of any expression is determined; (b) a truth assignment to the variables of the expression is output which renders true the greatest possible number of clauses; (c) all the truth assignments which render true the maximum number of clauses can be produced. © 2001 John Wiley & Sons, Inc. |
