A novel processor for dynamic evolution of constrained SAT problems: The dynamic evolution variant of the discrete Hopfield neural network satisfiability model

A novel processor for dynamic evolution of constrained SAT problems: The dynamic evolution variant of the discrete Hopfield neural network satisfiability model

The Boolean satisfiability problem, a renowned NP-complete challenge in computer science, has recently garnered interest in the Discrete Hopfield Neural Network - Satisfiability model. This model adeptly integrates logical rules into Hopfield networks, excelling in locating global minima for traditi...

Full description

Bibliographic Details
Main Authors: Caicai Feng, Saratha Sathasivam
Format: Article
Language:English
Published: Elsevier 2024-01-01
Series:Journal of King Saud University: Computer and Information Sciences
Subjects:
Discrete Hopfield neural network
Satisfiability problem
Logic programming
Dynamic constraint
Constrained SAT
Online Access:http://www.sciencedirect.com/science/article/pii/S1319157824000168

Internet

http://www.sciencedirect.com/science/article/pii/S1319157824000168

Similar Items