The Community for Technology Leaders
Green Image
<p>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.</p>
simulated annealing; Boltzmann machines; computational model; satisfiability; propositional calculus; consensus function maxima; Boltzmann machines; calculus; set theory; simulated annealing
F.J. Torrealdea, A. d'Anjou, M.C. Hernandez, M. Graña, "Solving Satisfiability Via Boltzmann Machines", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 15, no. , pp. 514-521, May 1993, doi:10.1109/34.211473
105 ms
(Ver 3.3 (11022016))