{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T12:17:44Z","timestamp":1788265064957,"version":"build-2803163510"},"reference-count":55,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100004595","name":"Universiti Sains Malaysia","doi-asserted-by":"publisher","award":["R502-KR-ARU001-0000002302-K134"],"award-info":[{"award-number":["R502-KR-ARU001-0000002302-K134"]}],"id":[{"id":"10.13039\/501100004595","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Applied Soft Computing"],"published-print":{"date-parts":[[2026,10]]},"DOI":"10.1016\/j.asoc.2026.115872","type":"journal-article","created":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T23:18:37Z","timestamp":1783120717000},"page":"115872","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"PC","title":["A discrete Hopfield neural network solves 3-SAT by optimizing weights based on clause-derived energy functions"],"prefix":"10.1016","volume":"202","author":[{"given":"Xiaojun","family":"Xie","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2843-7082","authenticated-orcid":false,"given":"Saratha","family":"Sathasivam","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/j.asoc.2026.115872_bib1","doi-asserted-by":"crossref","first-page":"1106","DOI":"10.1137\/0215080","article-title":"Probabilistic analysis of two heuristics for the 3-satisfiability problem","volume":"15","author":"Chao","year":"1986","journal-title":"SIAM J. Comput."},{"issue":"2","key":"10.1016\/j.asoc.2026.115872_bib2","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1016\/0743-7315(89)90068-3","article-title":"A neural network approach to the 3-satisfiability problem","volume":"6","author":"Johnson","year":"1989","journal-title":"J. Parallel Distrib. Comput."},{"issue":"10","key":"10.1016\/j.asoc.2026.115872_bib3","first-page":"44","article-title":"Accelerating activation function for 3-satisfiability logic programming","volume":"8","author":"Mansor","year":"2016","journal-title":"Int. J. Intell. Syst. Appl."},{"key":"10.1016\/j.asoc.2026.115872_bib4","article-title":"Satisfiability and model counting in open universes","author":"Belle","year":"2016","journal-title":"Proc. Workshops Thirtieth AAAI Conf. Artif. Intell."},{"issue":"9","key":"10.1016\/j.asoc.2026.115872_bib5","first-page":"22","article-title":"VLSI circuit configuration using satisfiability logic in Hopfield network","volume":"8","author":"Mansor","year":"2016","journal-title":"Int. J. Intell. Syst. Appl."},{"issue":"1","key":"10.1016\/j.asoc.2026.115872_bib6","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1109\/TVLSI.2017.2754192","article-title":"Efficient analog circuits for Boolean satisfiability","volume":"26","author":"Yin","year":"2018","journal-title":"IEEE Trans. Very Large Scale Integr. (VLSI) Syst."},{"key":"10.1016\/j.asoc.2026.115872_bib7","doi-asserted-by":"crossref","unstructured":"J. Zhu, A. Salhotra, C.R. Meinecke, et al., Solving the 3-SAT problem using network-based biocomputation, arXiv:2203.17154, 2022.","DOI":"10.1002\/aisy.202200202"},{"key":"10.1016\/j.asoc.2026.115872_bib8","series-title":"in: New Optimization Algorithms in Physics","first-page":"119","article-title":"The random 3-satisfiability problem: From the phase transition to the efficient generation of hard, but satisfiable problem instances","author":"Weigt","year":"2004"},{"issue":"7","key":"10.1016\/j.asoc.2026.115872_bib9","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1145\/368273.368557","article-title":"A machine program for theorem-proving","volume":"5","author":"Davis","year":"1962","journal-title":"Commun. ACM"},{"issue":"5","key":"10.1016\/j.asoc.2026.115872_bib10","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1109\/12.769433","article-title":"GRASP: A search algorithm for propositional satisfiability","volume":"48","author":"Marques-Silva","year":"1999","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/j.asoc.2026.115872_bib11","series-title":"in: Handbook of Satisfiability","first-page":"131","article-title":"Conflict-driven clause learning SAT solvers","author":"Marques-Silva","year":"2009"},{"key":"10.1016\/j.asoc.2026.115872_bib12","first-page":"4598","article-title":"Learning a SAT solver from single-bit supervision","volume":"80","author":"Selsam","year":"2018"},{"issue":"1","key":"10.1016\/j.asoc.2026.115872_bib13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/18756891.2016.1144149","article-title":"Predicting propositional satisfiability based on graph attention networks","volume":"15","author":"Luo","year":"2022","journal-title":"Int. J. Comput. Intell. Syst."},{"key":"10.1016\/j.asoc.2026.115872_bib14","doi-asserted-by":"crossref","DOI":"10.7717\/peerj-cs.2169","article-title":"Predicting the satisfiability of Boolean formulas using transformer-based neural networks","volume":"10","author":"Chang","year":"2024","journal-title":"PeerJ Comput. Sci."},{"issue":"3","key":"10.1016\/j.asoc.2026.115872_bib15","doi-asserted-by":"crossref","first-page":"423","DOI":"10.3390\/electronics14030423","article-title":"SAT-GATv2: A dynamic attention-based graph neural network for solving Boolean satisfiability problems","volume":"14","author":"Chang","year":"2025","journal-title":"Electronics"},{"issue":"11","key":"10.1016\/j.asoc.2026.115872_bib16","first-page":"4203","article-title":"Enhancing modern SAT solvers with machine learning methods","volume":"41","author":"Chen","year":"2022","journal-title":"IEEE Trans. Comput. -Aided Des. Integr. Circuits Syst."},{"key":"10.1016\/j.asoc.2026.115872_bib17","first-page":"123456","article-title":"Learning branching heuristics for SAT solvers via graph neural networks","volume":"9","author":"Xu","year":"2021","journal-title":"IEEE Access."},{"key":"10.1016\/j.asoc.2026.115872_bib18","series-title":"in: Handbook of Satisfiability","first-page":"629","article-title":"Machine learning in SAT solving","author":"Balyo","year":"2021"},{"issue":"21","key":"10.1016\/j.asoc.2026.115872_bib19","doi-asserted-by":"crossref","first-page":"12809","DOI":"10.1007\/s00521-024-09960-z","article-title":"Neuro-symbolic artificial intelligence: A survey","volume":"36","author":"Bhuyan","year":"2024","journal-title":"Neural Comput. Appl."},{"key":"10.1016\/j.asoc.2026.115872_bib20","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/j.neunet.2023.06.028","article-title":"A survey on neural-symbolic learning systems","volume":"166","author":"Yu","year":"2023","journal-title":"Neural Netw."},{"key":"10.1016\/j.asoc.2026.115872_bib21","first-page":"18245","article-title":"Graph neural network based SAT\/UNSAT classification: An empirical study","volume":"53","author":"Luo","year":"2023","journal-title":"Appl. Intell."},{"key":"10.1016\/j.asoc.2026.115872_bib22","article-title":"Attention-based deep learning for satisfiability prediction of Boolean formulas","volume":"213","author":"Chang","year":"2023","journal-title":"Expert. Syst. Appl."},{"key":"10.1016\/j.asoc.2026.115872_bib23","article-title":"On the expressive power of graph neural networks for Boolean satisfiability","volume":"317","author":"Peltonen","year":"2023","journal-title":"Artif. Intell."},{"key":"10.1016\/j.asoc.2026.115872_bib24","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevResearch.5.023147","article-title":"Solution of SAT problems with the adaptive-bias quantum approximate optimization algorithm","volume":"5","author":"Yu","year":"2023","journal-title":"Phys. Rev. Res."},{"issue":"1","key":"10.1016\/j.asoc.2026.115872_bib25","doi-asserted-by":"crossref","DOI":"10.1088\/2058-9565\/ad141d","article-title":"Amplitude amplification-inspired QAOA: Improving the success probability for solving 3-SAT","volume":"9","author":"Mandl","year":"2024","journal-title":"Quantum Sci. Technol."},{"issue":"1","key":"10.1016\/j.asoc.2026.115872_bib26","doi-asserted-by":"crossref","DOI":"10.1088\/2058-9565\/ad895c","article-title":"Grover-QAOA for 3-SAT: Quadratic speedup, fair-sampling, and parameter clustering","volume":"10","author":"Zhang","year":"2024","journal-title":"Quantum Sci. Technol."},{"key":"10.1016\/j.asoc.2026.115872_bib27","doi-asserted-by":"crossref","first-page":"50831","DOI":"10.1109\/ACCESS.2021.3068998","article-title":"Random satisfiability: A higher-order logical approach in discrete Hopfield neural network","volume":"9","author":"Karim","year":"2021","journal-title":"IEEE Access."},{"issue":"12","key":"10.1016\/j.asoc.2026.115872_bib28","doi-asserted-by":"crossref","first-page":"1963","DOI":"10.3390\/math10121963","article-title":"A novel multi-objective hybrid election algorithm for higher-order random satisfiability in discrete Hopfield neural network","volume":"10","author":"Karim","year":"2022","journal-title":"Mathematics"},{"issue":"3","key":"10.1016\/j.asoc.2026.115872_bib29","first-page":"963","article-title":"Optimal performance evaluation metrics for satisfiability logic representation in discrete Hopfield neural network","volume":"16","author":"Mansor","year":"2021","journal-title":"Int. J. Math. Comput. Sci."},{"issue":"6","key":"10.1016\/j.asoc.2026.115872_bib30","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1002\/int.4550070604","article-title":"Logic programming on a neural network","volume":"7","author":"Abdullah","year":"1992","journal-title":"Int. J. Intell. Syst."},{"issue":"1","key":"10.1016\/j.asoc.2026.115872_bib31","first-page":"115","article-title":"Upgrading logic programming in Hopfield network","volume":"39","author":"Sathasivam","year":"2010","journal-title":"Sains Malays."},{"key":"10.1016\/j.asoc.2026.115872_bib32","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/s00607-010-0117-9","article-title":"Logic mining in neural network: Reverse analysis method","volume":"91","author":"Sathasivam","year":"2011","journal-title":"Computing"},{"issue":"13","key":"10.1016\/j.asoc.2026.115872_bib33","first-page":"601","article-title":"Reverse analysis in higher order Hopfield network for higher order Horn clauses","volume":"8","author":"Sathasivam","year":"2014","journal-title":"Appl. Math. Sci."},{"issue":"6","key":"10.1016\/j.asoc.2026.115872_bib34","doi-asserted-by":"crossref","first-page":"1327","DOI":"10.17576\/jsm-2018-4706-30","article-title":"Discrete Hopfield neural network in restricted maximum k-satisfiability logic programming","volume":"47","author":"Kasihmuddin","year":"2018","journal-title":"Sains Malays."},{"issue":"1","key":"10.1016\/j.asoc.2026.115872_bib35","first-page":"139","article-title":"Hybrid genetic algorithm in the Hopfield network for logic satisfiability problem","volume":"25","author":"Kasihmuddin","year":"2017","journal-title":"Pertanika J. Sci. Technol."},{"issue":"1","key":"10.1016\/j.asoc.2026.115872_bib36","article-title":"Hybrid genetic algorithm in the Hopfield network for logic satisfiability problem","volume":"25","author":"Kasihmuddin","year":"2017","journal-title":"Pertanika J. Sci. Technol."},{"issue":"1","key":"10.1016\/j.asoc.2026.115872_bib37","doi-asserted-by":"crossref","DOI":"10.1088\/1742-6596\/1821\/1\/012038","article-title":"Grey wolf optimization algorithm with discrete Hopfield neural network for 3-satisfiability analysis","volume":"1821","author":"Mansor","year":"2021","journal-title":"J. Phys. Conf. Ser."},{"key":"10.1016\/j.asoc.2026.115872_bib38","article-title":"Modified lion optimization algorithm with discrete Hopfield neural network for higher order Boolean satisfiability programming","volume":"14","author":"Mansor","year":"2020","journal-title":"Malays. J. Math. Sci."},{"issue":"7","key":"10.1016\/j.asoc.2026.115872_bib39","doi-asserted-by":"crossref","first-page":"1129","DOI":"10.3390\/math10071129","article-title":"Non-systematic weighted satisfiability in discrete Hopfield neural network using binary artificial bee colony optimization","volume":"10","author":"Muhammad Sidik","year":"2022","journal-title":"Mathematics"},{"issue":"2","key":"10.1016\/j.asoc.2026.115872_bib40","doi-asserted-by":"crossref","first-page":"144","DOI":"10.11591\/ijai.v8.i2.pp144-155","article-title":"Hybrid imperialistic competitive algorithm incorporated with Hopfield neural network for robust 3-satisfiability logic programming","volume":"8","author":"Kathirvel","year":"2019","journal-title":"IAES Int. J. Artif. Intell."},{"key":"10.1016\/j.asoc.2026.115872_bib41","series-title":"Handbook of Satisfiability","first-page":"3","article-title":"A history of satisfiability","author":"Franco","year":"2009"},{"key":"10.1016\/j.asoc.2026.115872_bib42","first-page":"19","article-title":"Algorithms for the satisfiability (SAT) problem: A survey","author":"Gu","year":"1996","journal-title":"Satisf. Probl. Theory Appl."},{"key":"10.1016\/j.asoc.2026.115872_bib43","article-title":"Reasoning about strategies: On the satisfiability problem","volume":"13","author":"Mogavero","year":"2017","journal-title":"Log. Methods Comput. Sci."},{"issue":"2\u20133","key":"10.1016\/j.asoc.2026.115872_bib44","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1016\/j.artint.2007.05.006","article-title":"A logical approach to efficient Max-SAT solving","volume":"172","author":"Larrosa","year":"2008","journal-title":"Artif. Intell."},{"issue":"8","key":"10.1016\/j.asoc.2026.115872_bib45","doi-asserted-by":"crossref","first-page":"2554","DOI":"10.1073\/pnas.79.8.2554","article-title":"Neural networks and physical systems with emergent collective computational abilities","volume":"79","author":"Hopfield","year":"1982","journal-title":"Proc. Natl. Acad. Sci. U. S. A."},{"key":"10.1016\/j.asoc.2026.115872_bib46","doi-asserted-by":"crossref","DOI":"10.1109\/TCSI.2024.3382259","article-title":"Two-dimensional discrete bi-neuron Hopfield neural network with polyhedral hyperchaos","author":"Bao","year":"2024","journal-title":"IEEE Trans. Circuits Syst. I Regul. Pap."},{"issue":"4","key":"10.1016\/j.asoc.2026.115872_bib47","doi-asserted-by":"crossref","first-page":"9232","DOI":"10.3934\/math.2024450","article-title":"2-SAT discrete Hopfield neural networks optimization via crow search and fuzzy dynamical clustering approach","volume":"9","author":"Feng","year":"2024","journal-title":"AIMS Math."},{"issue":"1","key":"10.1016\/j.asoc.2026.115872_bib48","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/j.microrel.2009.08.006","article-title":"Using Boolean satisfiability for computing soft error rates in early design stages","volume":"50","author":"Ionescu","year":"2010","journal-title":"Microelectron. Reliab."},{"key":"10.1016\/j.asoc.2026.115872_bib49","first-page":"499","article-title":"VLSI implementation of an associative content addressable memory based on Hopfield network model","volume":"2","author":"Ionescu","year":"2010"},{"key":"10.1016\/j.asoc.2026.115872_bib50","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/j.neunet.2012.06.006","article-title":"Hopfield neural network: The hyperbolic tangent and the piecewise-linear activation functions","volume":"34","author":"Mathias","year":"2012","journal-title":"Neural Netw."},{"key":"10.1016\/j.asoc.2026.115872_bib51","first-page":"52","author":"Kasihmuddin","year":"2016","journal-title":"Genet. Algorithm restricted Maxim-.-. K. -Satisf. Hopfield Netw."},{"issue":"10","key":"10.1016\/j.asoc.2026.115872_bib52","doi-asserted-by":"crossref","first-page":"28100","DOI":"10.3934\/math.20241363","article-title":"Modeling of 3-SAT discrete Hopfield neural network optimization using genetic algorithm optimized K-modes clustering","volume":"9","author":"Xie","year":"2024","journal-title":"AIMS Math."},{"key":"10.1016\/j.asoc.2026.115872_bib53","series-title":"Combinatorial search: From algorithms to systems","author":"Hamadi","year":"2013"},{"issue":"5","key":"10.1016\/j.asoc.2026.115872_bib54","doi-asserted-by":"crossref","first-page":"568","DOI":"10.3390\/pr8050568","article-title":"Election algorithm for random k-satisfiability in the Hopfield neural network","volume":"8","author":"Sathasivam","year":"2020","journal-title":"Processes"},{"issue":"1","key":"10.1016\/j.asoc.2026.115872_bib55","doi-asserted-by":"crossref","DOI":"10.1016\/j.jksuci.2024.101927","article-title":"A novel processor for dynamic evolution of constrained SAT problems: The dynamic evolution variant of the discrete Hopfield neural network satisfiability model","volume":"36","author":"Feng","year":"2024","journal-title":"J. King Saud. Univ. Comput. Inf. Sci."}],"container-title":["Applied Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1568494626013207?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1568494626013207?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T11:42:58Z","timestamp":1788262978000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1568494626013207"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":55,"alternative-id":["S1568494626013207"],"URL":"https:\/\/doi.org\/10.1016\/j.asoc.2026.115872","relation":{},"ISSN":["1568-4946"],"issn-type":[{"value":"1568-4946","type":"print"}],"subject":[],"published":{"date-parts":[[2026,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A discrete Hopfield neural network solves 3-SAT by optimizing weights based on clause-derived energy functions","name":"articletitle","label":"Article Title"},{"value":"Applied Soft Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.asoc.2026.115872","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"115872"}}