On the use of associative memory in Hopfield networks designed to solve propositional satisfiability problems.
Natalya WeberWerner KochOzan ErdemTom FroesePublished in: CoRR (2023)
Keyphrases
- associative memory
- satisfiability problem
- hopfield networks
- solving hard
- neural network
- graph coloring problems
- np complete
- propositional logic
- temporal logic
- search algorithm
- stochastic local search
- conjunctive normal form
- hopfield network
- neural network model
- kohonen feature map
- scheduling problem
- phase transition
- davis putnam
- hopfield neural network
- davis putnam logemann loveland
- pspace complete
- knowledge base
- learning algorithm
- mathematical programming
- first order logic