A Multilevel Memetic Algorithm for Large SAT-Encoded Problems

Many researchers have focused on the satisfiability problem and on many of its variants due to its applicability in many areas of artificial intelligence. This NP-complete problem refers to the task of finding a satisfying assignment that makes a Boolean expression evaluate to True. In this work, we...

Full description

Saved in:
Bibliographic Details
Published inEvolutionary computation Vol. 20; no. 4; pp. 641 - 664
Main Author Bouhmala, Noureddine
Format Journal Article
LanguageEnglish
Published One Rogers Street, Cambridge, MA 02142-1209, USA MIT Press 01.12.2012
Subjects
Algorithms
Artificial Intelligence
Boolean algebra
boundary model checking
Expert systems
Hardware
Humans
Mathematical models
memetic algorithms
Models, Genetic
Multilevel
multilevel techniques
Regular Paper
Satisfiability problem
Stochastic Processes
Tasks
Wilcoxon rank test
Online AccessGet full text

Cover

More Information
Summary:Many researchers have focused on the satisfiability problem and on many of its variants due to its applicability in many areas of artificial intelligence. This NP-complete problem refers to the task of finding a satisfying assignment that makes a Boolean expression evaluate to True. In this work, we introduce a memetic algorithm that makes use of the multilevel paradigm. The multilevel paradigm refers to the process of dividing large and difficult problems into smaller ones, which are hopefully much easier to solve, and then work backward toward the solution of the original problem, using a solution from a previous level as a starting solution at the next level. Results comparing the memetic with and without the multilevel paradigm are presented using problem instances drawn from real industrial hardware designs.
Bibliography:Winter, 2012
ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ObjectType-Article-2
ObjectType-Feature-1
ISSN:1063-6560
1530-9304
DOI:10.1162/EVCO_a_00078