DOE OSTI · 22306155
Satisfiability of logic programming based on radial basis function neural networks
Abstract
In this paper, we propose a new technique to test the Satisfiability of propositional logic programming and quantified Boolean formula problem in radial basis function neural networks. For this purpose, we built radial basis function neural networks to represent the proportional logic which has exactly three variables in each clause. We used the Prey-predator algorithm to calculate the output weights of the neural networks, while the K-means clustering algorithm is used to determine the hidden parameters (the centers and the widths). Mean of the sum squared error function is used to measure the activity of the two algorithms. We applied the developed technique with the recurrent radial basis function neural networks to represent the quantified Boolean formulas. The new technique can be applied to solve many applications such as electronic circuits and NP-complete problems.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Hamadneh, Nawaf, Sathasivam, Saratha, Tilahun, Surafel Luleseged, Choon, Ong Hong. 2014-07-10. Satisfiability of logic programming based on radial basis function neural networks. https://doi.org/10.1063/1.4887647
Cite the original work for its findings. Save a collection to share your selection of sources.