Major 2 satisfiability logic in discrete Hopfield neural network
From MaRDI portal
Publication:5072024
Recommendations
- Optimal performance evaluation metrics for satisfiability logic representation in discrete Hopfield neural network
- Normal form representation in doing logic programming in Hopfield network
- scientific article; zbMATH DE number 5575002
- scientific article; zbMATH DE number 776082
- scientific article; zbMATH DE number 1630006
Cites work
- A Boolean satisfiability approach to the resource-constrained project scheduling problem
- A new Lyapunov functional for stability analysis of neutral-type Hopfield neural networks with multiple delays
- Algorithm runtime prediction: methods \& evaluation
- Combining Hopfield neural networks, with applications to grid-based mathematics puzzles
- Improving exhaustive search implies superpolynomial lower bounds
- Metric and Euclidean properties of dissimilarity coefficients
- Modal posterior clustering motivated by Hopfield's network
- Upgrading logic programming in Hopfield network
- ``Neural computation of decisions in optimization problems
Cited in
(4)- Normal form representation in doing logic programming in Hopfield network
- Optimal performance evaluation metrics for satisfiability logic representation in discrete Hopfield neural network
- scientific article; zbMATH DE number 7314124 (Why is no real title available?)
- Propositional Satisfiability Logic via Ant Colony Optimization in Hopfield Neural Network
This page was built for publication: Major 2 satisfiability logic in discrete Hopfield neural network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5072024)