DocumentCode
889644
Title
Solving satisfiability via Boltzmann machines
Author
Anjou, A.D. ; Grana, Manuel ; Torrealdea, F.J. ; Hernandez, M.C.
Author_Institution
Fac. de Inf., Univ. del Pais Vasco, San Sebastian, Spain
Volume
15
Issue
5
fYear
1993
fDate
5/1/1993 12:00:00 AM
Firstpage
514
Lastpage
521
Abstract
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
Keywords
Boltzmann machines; calculus; set theory; simulated annealing; Boltzmann machines; computational model; consensus function maxima; propositional calculus; satisfiability; simulated annealing; Calculus; Computational modeling; Design optimization; Optimization methods; Parallel processing; Recurrent neural networks; Simulated annealing; Stochastic processes; Testing; Uncertainty;
fLanguage
English
Journal_Title
Pattern Analysis and Machine Intelligence, IEEE Transactions on
Publisher
ieee
ISSN
0162-8828
Type
jour
DOI
10.1109/34.211473
Filename
211473
Link To Document