Functional vector generation for HDL models using linear programming and 3-satisfiability
DAC '98 Proceedings of the 35th annual Design Automation Conference
Symbolic model checking using SAT procedures instead of BDDs
Proceedings of the 36th annual ACM/IEEE Design Automation Conference
An adaptive evolutionary algorithm for the satisfiability problem
SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 1
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Theory and Practice of Uncertain Programming
Theory and Practice of Uncertain Programming
Genetic-fuzzy approach to the Boolean satisfiability problem
IEEE Transactions on Evolutionary Computation
Combinational test generation using satisfiability
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Leakage current optimization techniques during test based on don't care bits assignment
Journal of Computer Science and Technology
| Hi-index | 0.01 |
This paper is concerned with Boolean satisfiability (SAT) Problem. Many researchers are devoted into seeking for new ideas as well as developing more efficient SAT solvers which will improve the development of EDA (Electronic Design Automation). In this paper, we try to solve the SAT problem by fuzzy genetic algorithm with partitioning-based initial process, namely PFGASAT. Some heuristic mechanisms have been introduced which make the algorithm more intellective. Primary experiments show that PFGASAT can solve SAT problems with more than 15k variables while behaves rather stably and robustly.