GRASP: A Search Algorithm for Propositional Satisfiability
IEEE Transactions on Computers
A machine program for theorem-proving
Communications of the ACM
Local Search Algorithms for SAT: An Empirical Evaluation
Journal of Automated Reasoning
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
A New Quantum Evolutionary Local Search Algorithm for MAX 3-SAT Problem
HAIS '08 Proceedings of the 3rd international workshop on Hybrid Artificial Intelligence Systems
A new method for solving hard satisfiability problems
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
A backbone-based co-evolutionary heuristic for partial MAX-SAT
EA'05 Proceedings of the 7th international conference on Artificial Evolution
Hi-index | 0.00 |
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.