关于联想记忆在用于求解命题可满足性问题的Hopfield网络中的应用研究
On the use of associative memory in Hopfield networks designed to solve propositional satisfiability problems
AI总结：
该研究探索用于求解命题可满足性问题的Hopfield网络中联想记忆的应用，验证了自优化（SO）模型可求解SAT类组合问题，同时发现其存在关键信息丢失生成伪最优解的副作用，可为难解问题求解研究提供启发。
摘要：
Hopfield网络因具备生物学上合理的机制，是求解多种计算问题的理想选择。自优化（Self-Optimization，SO）模型对Hopfield网络进行了拓展，它采用具有生物学依据的Hebbian学习规则，结合将网络反复重置为任意初始状态的操作，朝着网络中编码的理想目标状态优化自身行为。为更好地理解这一过程，我们首先以说谎者问题和地图着色问题两个实例，证明SO模型能够求解SAT形式的具体组合问题。此外，我们还展示了在某些条件下，关键信息可能会永久丢失，导致经过学习的网络生成看似最优、实则不符合待求解问题要求的解。这种看似是SO模型不良副作用的现象，能够为我们理解其求解难解问题的过程提供启发。
英文摘要：
Hopfield networks are an attractive choice for solving many types of computational problems because they provide a biologically plausible mechanism. The Self-Optimization (SO) model adds to the Hopfield network by using a biologically founded Hebbian learning rule, in combination with repeated network resets to arbitrary initial states, for optimizing its own behavior towards some desirable goal state encoded in the network. In order to better understand that process, we demonstrate first that the SO model can solve concrete combinatorial problems in SAT form, using two examples of the Liars problem and the map coloring problem. In addition, we show how under some conditions critical information might get lost forever with the learned network producing seemingly optimal solutions that are in fact inappropriate for the problem it was tasked to solve. What appears to be an undesirable side-effect of the SO model, can provide insight into its process for solving intractable problems.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
