Maximum 2-satisfiability in radial basis function neural network
Maximum k-Satisfiability (MAX-kSAT) is the logic to determine the maximum number of satisfied clauses. Correctly, this logic plays a prominent role in numerous applications as a combinatorial optimization logic. MAX2SAT is a case of MAX-kSAT and is written in Conjunctive Normal Form (CNF) with two v...
Main Authors: | Shehab Abdulhabib Alzaeemi, Saratha Sathasivam, Mohd Shareduwan Mohd Kasihmuddin, Mohd. Asyraf Mansor |
---|---|
Format: | Article |
Language: | English |
Published: |
Penerbit Universiti Kebangsaan Malaysia
2020
|
Online Access: | http://journalarticle.ukm.my/15097/1/jqma-16-1-paper11.pdf |
Similar Items
-
Satisfiability Logic Analysis Via Radial Basis Function Neural Network with Artificial Bee Colony Algorithm
by: Mohd Shareduwan Bin Mohd Kasihmuddin, et al.
Published: (2021-05-01) -
Discrete hopfield neural network in restricted maximum
k-satisfiability logic programming
by: Mohd Shareduwan Mohd Kasihmuddin,, et al.
Published: (2018) -
Genetic Algorithm for Restricted Maximum k-Satisfiability in the Hopfield Network
by: Mohd Shareduwan Bin Mohd Kasihmuddin, et al.
Published: (2016-12-01) -
Robust Artificial Immune System in the Hopfield network for Maximum k-Satisfiability
by: Mohd Asyraf Bin Mansor, et al.
Published: (2017-08-01) -
Discrete mutation hopfield neural network in propositional satisfiability
by: Mohd. Kasihmuddin, Mohd. Shareduwan, et al.
Published: (2019)