Discrete Hopfield Neural Network in Restricted Maximum k-Satisfiability Logic Programming
نویسندگان
چکیده
منابع مشابه
Genetic Algorithm for Restricted Maximum k-Satisfiability in the Hopfield Network
The restricted Maximum k-Satisfiability MAXkSAT is an enhanced Boolean satisfiability counterpart that has attracted numerous amount of research. Genetic algorithm has been the prominent optimization heuristic algorithm to solve constraint optimization problem. The core motivation of this paper is to introduce Hopfield network incorporated with genetic algorithm in solving MAX-kSAT problem. Gen...
متن کاملUpgrading Logic Programming in Hopfield Network
The convergence property for doing logic programming in Hopfield network can be accelerated by using new relaxation method. This paper shows that the performance of the Hopfield network can be improved by using a relaxation rate to control the energy relaxation process. The capacity and performance of these networks is tested by using computer simulations. It was proven by computer simulations ...
متن کاملRobust Artificial Immune System in the Hopfield network for Maximum k-Satisfiability
Artificial Immune System (AIS) algorithm is a novel and vibrant computational paradigm, enthused by the biological immune system. Over the last few years, the artificial immune system has been sprouting to solve numerous computational and combinatorial optimization problems. In this paper, we introduce the restricted MAX-kSAT as a constraint optimization problem that can be solved by a robust c...
متن کاملVLSI Circuit Configuration Using Satisfiability Logic in Hopfield Network
Very large scale integration (VLSI) circuit comprises of integrated circuit (IC) with transistors in a single chip, widely used in many sophisticated electronic devices. In our paper, we proposed VLSI circuit design by implementing satisfiability problem in Hopfield neural network as circuit verification technique. We restrict our logic construction to 2-Satisfiability (2-SAT) and 3Satisfiabili...
متن کاملLogic programming with satisfiability
This paper presents a Prolog interface to the MiniSat satisfiability solver. Logic programming with satisfiability combines the strengths of the two paradigms: logic programming for encoding search problems into satisfiability on the one hand and efficient SAT solving on the other. This synergy between these two exposes a programming paradigm which we propose here as a logic programming pearl. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Sains Malaysiana
سال: 2018
ISSN: 0126-6039
DOI: 10.17576/jsm-2018-4706-30