A modified Hopfield Artificial Neural Network is proposed to solve effectively and efficiently Boolean Satisfiability (SAT) NP-hard problems. The proposed Neural Network is compared against other traditional methods employed in this field, such as Greedy SAT and Genetic Algorithms for SAT. The results show that the proposed network represents a good alternative given their output quality and response time speed.
Modified Neural Net for the Boolean Satisfiability Problem
2015-11-01
149850 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
A sharp threshold for the phase transition of a restricted Satisfiability problem for Horn clauses
British Library Online Contents | 2001
|