Discrete hopfield neural network in restricted maximum k-satisfiability logic programming
Maximum k-Satisfiability (MAX-kSAT) consists of the most consistent interpretation that generate the maximum number of satisfied clauses. MAX-kSAT is an important logic representation in logic programming since not all combinatorial problem is satisfiable in nature. This paper presents Hopfield Neur...
Main Authors: | Mohd Shareduwan Mohd Kasihmuddin, Mohd Asyraf Mansor, Saratha Sathasivam |
---|---|
Format: | Article |
Language: | English |
Published: |
Penerbit Universiti Kebangsaan Malaysia
2018
|
Online Access: | http://journalarticle.ukm.my/12139/ http://journalarticle.ukm.my/12139/ http://journalarticle.ukm.my/12139/1/30%20Mohd%20Shareduwan%20Mohd%20Kasihmuddin.pdf |
Similar Items
-
Upgrading logic programming in hopfield network
by: Saratha Sathasivam,
Published: (2010) -
Honour satisfied a Dorset rifleman at war 1916-1918
by: Warren
Published: (1990) -
On Test Case Generation Satisfying the MC/DC Criterion
by: Kamal Z., Zamli, et al.
Published: (2013) -
Satisfying internal customers first a practical guide to improving internal and external customer statisfaction
by: Chang
Published: (1995) -
Study on a maximum paper fibre recovery network design
by: Kamilia Hani, Mohd Bashri
Published: (2013)