
Multilevel Techniques for solving the Satisfiability Problem
Enhancing Tabu Search and Learning Automata
LAP Lambert Academic Publishing
Published on 20. May 2012
Book
Paperback/Softback
124 pages
978-3-659-13197-4 (ISBN)
Description
There are many complex problems in computer science that occur in knowledge-representation, artificial learning, Very Large Scale Integration (VLSI) design, security protocols and other areas. These complex problems may be deduced into satisfiability problems where the Boolean Satisfiability Problem (SAT) may be applied. This deduction is made in order to simplify complex problems into a specific propositional logic problem. The SAT problem is the most well-known nondeterministic polynomial time (NP) complete problem in computer science. In this book, we solve the SAT problem using a clustering technique - Multilevel - combined first with the Tabu Search algorithm and combined thereafter with finite Learning Automata. Tabu Search and finite Learning Automata are two very efficient approaches that have been used to solve SAT.
More details
Language
English
Place of publication
Germany
Product notice
Paperback (trade)
Unsewn / adhesive bound
Dimensions
Height: 220 mm
Width: 150 mm
Thickness: 9 mm
Weight
203 gr
ISBN-13
978-3-659-13197-4 (9783659131974)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Persons
Sirar Salih obtained his M.Sc. degree in Information and Communication Technology from the University of Agder, Norway, in 2011. Since then he has worked as a consultant and has been involved in many projects in the field of computer programming. In complexity theory, his work on the SAT problem has been included in international journal papers.