Multilevel Techniques for solving the Satisfiability Problem

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.

Autorentext

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.