Satisfiability of logic programming based on radial basis function neural networks
- School of Mathematical Sciences, Universiti Sains Malaysia, 11800 USM, Penang (Malaysia)
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.
- OSTI ID:
- 22306155
- Journal Information:
- AIP Conference Proceedings, Vol. 1605, Issue 1; Conference: SKSM21: 21. national symposium on mathematical sciences: Germination of mathematical sciences education and research towards global sustainability, Penang (Malaysia), 6-8 Nov 2013; Other Information: (c) 2014 AIP Publishing LLC; Country of input: International Atomic Energy Agency (IAEA); ISSN 0094-243X
- Country of Publication:
- United States
- Language:
- English
Similar Records
The Knowledge-Based Technology Applications Center (KBTAC) seminar series. Volume 4, Introduction to neural networks and fuzzy logic: Final report
Wavelet-based neural network with fuzzy-logic adaptivity for nuclear image restoration