Abstract
Summary form only given, as follows. Based on Hopfield's associative memory model, a scheme for solving 3-satisfiability (3-SAT) problems is proposed. For problems such as 3-SAT, the partial constraints are easy to determine, but the global constraint is hard to find. The neural network associative memory is viewed as some kind of active memory, which means that it does not just memorize data items, but also manipulates those stored data. The operations that it can perform can be considered as constraint satisfaction. Thus, it is possible to store partial assignments which satisfy the local constraints of the problem and let the memory compose complete assignments which satisfy the global constraints. Simulation results show that this scheme can solve most instances of 3-SAT. >
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
