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...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Penerbit Universiti Kebangsaan Malaysia
2018
|
| Online Access: | http://journalarticle.ukm.my/12139/1/30%20Mohd%20Shareduwan%20Mohd%20Kasihmuddin.pdf http://journalarticle.ukm.my/12139/ http://www.ukm.my/jsm/english_journals/vol47num6_2018/contentsVol47num6_2018.html |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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 Neural Network based on MAX-kSAT logical rule. Learning of Hopfield Neural Network will be integrated with Wan Abdullah method and Sathasivam relaxation method to obtain the correct final state of the neurons. The computer simulation shows that MAX-kSAT can be embedded optimally in Hopfield Neural Network. |
|---|