On the Use of Associative Memory in Hopfield Networks Designed to Solve Propositional Satisfiability Problems.
Natalya WeberWerner KochOzan ErdemTom FroesePublished in: SSCI (2023)
Keyphrases
- associative memory
- satisfiability problem
- hopfield networks
- solving hard
- propositional logic
- np complete
- graph coloring problems
- neural network
- kohonen feature map
- temporal logic
- davis putnam
- search algorithm
- hopfield network
- sat problem
- first order logic
- phase transition
- neural network model
- pspace complete
- hopfield neural network
- stochastic local search
- mathematical programming
- davis putnam logemann loveland