|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
28th Annual International Computer Software and Applications Conference (COMPSAC'04)
PFGASAT— A Genetic SAT Solver Combining Partitioning and Fuzzy Strategies
Hong Kong
September 28-September 30
ISBN: 0-7695-2209-2
| ASCII Text | x | ||
| Jianzhou Zhao, Jinian Bian, Weimin Wu, "PFGASAT— A Genetic SAT Solver Combining Partitioning and Fuzzy Strategies," 2012 IEEE 36th Annual Computer Software and Applications Conference, vol. 1, pp. 108-113, 28th Annual International Computer Software and Applications Conference (COMPSAC'04), 2004. | |||
| BibTex | x | ||
| @article{ 10.1109/CMPSAC.2004.1342813, author = {Jianzhou Zhao and Jinian Bian and Weimin Wu}, title = {PFGASAT— A Genetic SAT Solver Combining Partitioning and Fuzzy Strategies}, journal ={2012 IEEE 36th Annual Computer Software and Applications Conference}, volume = {1}, year = {2004}, issn = {0730-3157}, pages = {108-113}, doi = {http://doi.ieeecomputersociety.org/10.1109/CMPSAC.2004.1342813}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - 2012 IEEE 36th Annual Computer Software and Applications Conference TI - PFGASAT— A Genetic SAT Solver Combining Partitioning and Fuzzy Strategies SN - 0730-3157 SP108 EP113 A1 - Jianzhou Zhao, A1 - Jinian Bian, A1 - Weimin Wu, PY - 2004 KW - null VL - 1 JA - 2012 IEEE 36th Annual Computer Software and Applications Conference ER - | |||
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.
Citation:
Jianzhou Zhao, Jinian Bian, Weimin Wu, "PFGASAT— A Genetic SAT Solver Combining Partitioning and Fuzzy Strategies," compsac, vol. 1, pp.108-113, 28th Annual International Computer Software and Applications Conference (COMPSAC'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.