Mean Field Theory in Doing Logic Programming Using Hopfield Network
- Muraly Velavan
- Zainor Ridzuan bin Yahya
- Mohamad Nazri bin Abdul Halif
- Saratha Sathasivam
Abstract
Logic program and neural networks are two important perspectives in artificial intelligence. Logic describes connections among propositions. Moreover, logic must have descriptive symbolic tools to represent propositions. Meanwhile representation of neural networks on the other hand is in non-symbolic form. The objective in performing logic programming revolves around energy minimization is to reach the best global solutions. On the other hand, we usually gets local minima solutions also. In order to improve this, based on the Boltzmann machine concept, we will derive a learning algorithm in which time-consuming stochastic measurements of collerations are replaced by solutions to deterministic mean field theory (MFT) equations. The main idea of mean field algorithm is to replace the real unstable induced local field for each neuron in the network with its average local field value. Then, we build agent based modelling (ABM) by using Netlogo for this task.- Full Text: PDF
- DOI:10.5539/mas.v10n1p154
This work is licensed under a Creative Commons Attribution 4.0 License.
Journal Metrics
(The data was calculated based on Google Scholar Citations)
h5-index (July 2022): N/A
h5-median(July 2022): N/A
Index
- Aerospace Database
- American International Standards Institute (AISI)
- BASE (Bielefeld Academic Search Engine)
- CAB Abstracts
- CiteFactor
- CNKI Scholar
- Elektronische Zeitschriftenbibliothek (EZB)
- Excellence in Research for Australia (ERA)
- JournalGuide
- JournalSeek
- LOCKSS
- MIAR
- NewJour
- Norwegian Centre for Research Data (NSD)
- Open J-Gate
- Polska Bibliografia Naukowa
- ResearchGate
- SHERPA/RoMEO
- Standard Periodical Directory
- Ulrich's
- Universe Digital Library
- WorldCat
- ZbMATH
Contact
- Sunny LeeEditorial Assistant
- mas@ccsenet.org