Boltzmann machines (BMs) are proposed as a computational model for the solution of the satisfiability (SAT) problem in the propositional calculus setting. Conditions that guarantee consensus function maxima for configurations of the BM associated with solutions to the satisfaction problem are given. Experimental results that show a linear behavior of BMs solving the satisfiability problem are presented and discussed.>
No takes yet. Share an insight, caveat, or question.
d’Anjou et al. (1993) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: