A New Artificial Immune System for Solving the Maximum Satisfiability Problem

Abstract

In this paper we investigate the use of Artificial Immune Systems’ principles to cope with the satisfiability problem. We describe ClonSAT, a new iterative approach for solving the well known Maximum Satisfiability (Max-SAT) problem. This latter has been shown to be NP-hard if the number of variables per clause is greater than 3. The underlying idea is to harness the optimization capabilities of artificial clonal selection algorithm to achieve good quality solutions for MaxSAT problem. To foster the process, a local search has been used. The obtained results are very encouraging and show the feasibility and effectiveness of the proposed hybrid approach.