充足可能性問題を解くニューラルネットワークの相互結合網による実現について(一般講演,ライフサイエンスとソフトンピューティング)

抄録

SAT is a problem to determine whether a given Boonean expression which is represented by the CNF has solution or not We proposed a neural network called LPPH which can solve the SAT effectively. The LPPH can be considered as a network of interconnected variables and clauses of CNF. In this paper we propose a interconnected network which implements the LPPH.